Don't ask to share. Share! :D
Anyway i'm intereseted. I'm making some practice.
On Wed, Aug 26, 2009 at 9:49 PM, P.S. wrote:
>
> Hi everyone! Let's write python's code in this discussion! May be
> anyone of us will learn something new in this examples! I have some
> code of python, but all my co
i would prefer:
for case in xrange(input()):
do something with case
print 'Case %d: %s' % (case + 1, output)
and then:
$ python script output
On Fri, Aug 28, 2009 at 11:22 AM, Ronaldo Osure wrote:
> Yeah! Exceptions are a must when handling files!
>
> On Fri, Aug 28, 2009 at 11:22 AM, Rodri
On Tue, Sep 1, 2009 at 8:19 AM, Luke Pebody wrote:
>
> Let us label the fifteen cards in the order they start A, B, ... , O.
> So the initial order is ABCDEFGHIJKLMNO. The top card (A) is picked,
> and then the next card (B) is put to the bottom of the pack so the
> order is now CDEFGHIJKLMNOB. No
I vote for you too!
On Fri, Sep 4, 2009 at 9:07 AM, r_debashis wrote:
>
> Yes, actually I was also looking for similar features.
> At least we should be able to sort/filter by currently viewable
> fields, especially country.
> Code jam team is that possible?
>
> Thanks,
> Debashis
>
> On Sep 4, 1
I was looking too for a way of listing partecipants by country provenience!
But atm it seems there is no way to do that!
On Fri, Sep 4, 2009 at 3:44 AM, Paulo Eduardo Neves wrote:
>
> Does anybody here have participation statistics for the first round? I
> can see that 9724 candidates submitted s
Ops i just noticed that such (at least country filtering) a feature is
present at
http://www.go-hero.net/jam/
So we have to wait till the q-round data will be up for sharing!
On Fri, Sep 4, 2009 at 11:30 AM, Matteo Landi wrote:
> I vote for you too!
>
> On Fri, Sep 4, 2009 a
Just wait for an update from:
http://www.go-hero.net/jam
There we can country stats from 2008.
On Fri, Sep 4, 2009 at 3:13 PM, Baroukh wrote:
>
> I am also interested in this. Especially the country answer...
>
> On Sep 4, 4:44 am, Paulo Eduardo Neves wrote:
>> Does anybody here have participati
Not atm, but hope in the next days. There is still 7 days to the Round 1.
On Fri, Sep 4, 2009 at 1:26 PM, Abhishek Engg wrote:
>
> Hello,
> Last year on clearing a round i use to get a mail that i have
> qualified for next one but this year i didn't get though it looks m
> qualified :D. Anyone go
avoid this:
> if (mults[18]<1000) fprintf(pOut,"0");
> if (mults[18]<100) fprintf(pOut,"0");
> if (mults[18]<10) fprintf(pOut,"0");
> fprintf(pOut,"%d\n",mults[18]);
use instead:
fprintf(pOut, "%04d\n", mults[18]);
--
M@
http://matteolandi.altervista.org/
--~--~-
he/she missed one large input so from first he/she went 2428th :)
On Fri, Sep 4, 2009 at 11:16 PM, Mustafa Acer wrote:
>
> Neal Wu was the leader during the contest. Now he doesn't appear on
> the scoreboard. What happened to him? I hope he is not disqualified.
> Brilliant guy.
>
> >
>
--
M@
Personally speaking i did %1000 instead %1! And this kind of error
has come out only in the large input! ;)
On Fri, Sep 4, 2009 at 10:59 PM, Bey wrote:
>
> Hi
> I noticed that there are a large number of people who go the small
> input correct for prob C but not the large input. I was wonderi
Why you said that?
Recursion is part of dynamic programming (top down approach), am i wrong?
On Sat, Sep 5, 2009 at 6:13 PM, itissid wrote:
>
> Dude that factorial example is not DP!!!
>
> On Sep 5, 12:43 am, Hawston LLH wrote:
>> maybe you can read more on dynamic programming first, it is about
On Mon, Sep 7, 2009 at 12:03 PM, Ruturaj Dhekane wrote:
> Codejam problems are sometimes very similar to real life problems.
>
> The watershed, for example, is used in image segmentation.
> I came across this the day after Code jam, when we had a seminar on image
> segmentation. Apparently, some p
In this case you will notice it at the end of the subround, thus
before the second
or third one, and everything will be ok.
On Wed, Sep 9, 2009 at 3:51 PM, Vexorian wrote:
>
> You could get thrown out of the top 1000 without cheating if you
> accidentally submit a wrong code for one of the proble
I've just received the email, so the ufficial notification has been sent!
On Thu, Sep 10, 2009 at 10:21 PM, romanr wrote:
> Well, seems there won't be any invitation to Round 1, so anybody can
> participate?
> Or entrance will be restricted by web-site?
>
> David M. wrote:
>
> Carlos is right, r
Here is a solution very similar to the one explained by Lev:
http://code.matteolandi.net/svn/hacks/gcj/2009/round-1b/a-decision-tree/script.py
I elaborated it after the contest ending :(
On Sun, Sep 13, 2009 at 9:31 AM, Mahendra Kariya
wrote:
> @Lev
> Can u elaborate a bit more. Or tell me ur
Round 1B, problem A: it seems the precision required would be 10^-6
but the solution
shows 'print "%.7f" % Evaluate(tree, features)'. I suppose it to be a
typo error.
Anyway, very nice analysis.
On Tue, Sep 15, 2009 at 10:12 AM, ulzha wrote:
>
> A minor glitch in 1C-C: // Start the computation.
low
> for much higher precision than asked for just in case you had an off-
> by-one error somewhere.
>
> On Sep 15, 9:01 pm, Matteo Landi wrote:
>> Round 1B, problem A: it seems the precision required would be 10^-6
>> but the solution
>> shows 'print "%.7f"
scribe from this group, send email to
> google-code+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/google-code?hl=en.
>
--
Matteo Landi
http://www.matteolandi.net/
--
You received this message because you are subscribed to the
gle-codejam" group.
> To post to this group, send email to google-c...@googlegroups.com.
> To unsubscribe from this group, send email to
> google-code+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/google-code?hl=en.
>
>
--
Ma
oups.com.
> For more options, visit this group at
> http://groups.google.com/group/google-code?hl=en.
>
>
--
Matteo Landi
http://www.matteolandi.net/
--
You received this message because you are subscribed to the Google Groups
"google-codejam" group.
To post to this gro
il to google-c...@googlegroups.com.
> To unsubscribe from this group, send email to
> google-code+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/google-code?hl=en.
>
>
--
Matteo Landi
http://www.matteolandi.ne
oogle.com/group/google-code?hl=en.
>>
>
> --
> You received this message because you are subscribed to the Google Groups
> "google-codejam" group.
> To post to this group, send email to google-c...@googlegroups.com.
> To unsubscribe from this group, send em
message because you are subscribed to the Google Groups
> "google-codejam" group.
> To post to this group, send email to google-c...@googlegroups.com.
> To unsubscribe from this group, send email to
> google-code+unsubscr...@googlegroups.com
> .
> For more options, vis
this group, send email to
>> google-code+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/google-code?hl=en.
>>
>
> --
> You received this message because you are subscribed to the Google Groups
> "google-
Check this out: http://en.wikipedia.org/wiki/Necklace_problem
On Fri, Jun 4, 2010 at 9:40 PM, Paul Smith wrote:
> I don't get it...
>
> Paul Smith
>
> p...@pollyandpaul.co.uk
>
> On Fri, Jun 4, 2010 at 8:02 PM, Matteo Landi wrote:
>> ehhehe, well said!
>
ogle Groups
> "google-codejam" group.
> To post to this group, send email to google-c...@googlegroups.com.
> To unsubscribe from this group, send email to
> google-code+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group
gle Groups
> "google-codejam" group.
> To post to this group, send email to google-c...@googlegroups.com.
> To unsubscribe from this group, send email to
> google-code+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.
oogle-codejam" group.
> To post to this group, send email to google-c...@googlegroups.com.
> To unsubscribe from this group, send email to
> google-code+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/google-code?hl=en.
>
k(n):
if n is visited
return
mark `n' as visited
walk(m)
I hope it helps.
Regards,
Matteo
[1] http://en.wikipedia.org/wiki/Kruskal's_algorithm
--
Matteo Landi
http://www.matteolandi.net/
--
You received this message because you are subscrib
Hi all,
reading the Terms page [1] I discovered that Italy is no more included in
the list of participating countries: what's happened?
Regards,
Matteo
[1] https://code.google.com/codejam/terms.html
--
You received this message because you are subscribed to the Google Groups
"google-codejam"
Hi guys,
what do you think about my Python solution (http://ideone.com/nlbdA)?
To solve the problem I used dynamic programming.
Imagine our input array to be [1, 2, 3, 4, 1, 1], and let's start to
process it from left to right.
- slice [1]: there is nothing we can do with this slice (winning
sli
Wrong mailing-list.
On Sun, Dec 11, 2011 at 10:30 AM, Hussein El-Sayed
wrote:
> Dear Google Team,
>
> Please i want to know why Egyptians can't sign up for the android
> market to obtain a publish key? don't you believe that we are
> developers
>
> Thanks,
> Hussein
>
> --
> You received this
What about mapping dates to integer and then use logarithmic search to find
whether surrounding dates ``a'' and ``b'' are a starting and ending point
respectively of a range?
Cheers,
Matteo
On Jan/10, Morgan Bauer wrote:
> Map dates to integers and use a range tree.
>
> ~mhb
> On Jan 10, 2012 1
> Yes, I thimk 90% of questions about this problem can be answered checking the
> solution against these insidious edge cases. Here is a sample testcase:
What about the remaining 10%? :)
This problem is driving me crazy; I get right the right output for all the
examples I found around, but when
On Monday, April 8, 2019 at 7:33:10 PM UTC+2, Vinodharanie Sivalingam wrote:
> On Sunday, 7 April 2019 18:57:19 UTC+5:30, Vinodharanie Sivalingam wrote:
> > Can anyone tell what are the possible reasons for getting RE in
> > cryptopanagram in java?
>
> I found the error. The reason is I didn't h
Hey,
Is there anyone using Lisp to solve the problems? I would love to read
other people solutions, and I would not mind sharing mine if anyone was
interested (well, I am not an expert, so...)
Ciao,
Matteo
--
Matteo Landi
https://matteolandi.net
--
You received this message because you are
On 04/09, Zenquiorra wrote:
Does your code works for the cipher text:
1 1 1 1 1 1 1 1 2 6
?
Even though 1 is not a prime and by consequence the ciphertext above
should not be considered as valid input, my solution out is: ABC
Ciao,
Matteo
--
Matteo Landi
https://matteolandi.net
solution
should blow up.
Ciao,
Matteo
--
Matteo Landi
https://matteolandi.net
--
You received this message because you are subscribed to the Google Groups "Google
Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to google-cod
Is this a valid input, though? L is 30 in this case but then the
cyphertext length is 31.
Are we supposed to trust L, and ignore any extra number from the
cyphertext? If so that would be quite disappointing..
Matteo
--
Matteo Landi
https://matteolandi.net
--
You received this message
rmat t "Case #~d: ~a~%" i mine)))
Ciao,
Matteo
--
Matteo Landi
https://matteolandi.net
--
You received this message because you are subscribed to the Google Groups "Google
Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to g
:for i :from 1 :to (parse-integer (read-line))
:for ignored = (read)
:for size = (read)
:for ciphertext = (read-ciphertext size)
:for plaintext = (solve (subseq ciphertext 0 size))
:do (format t "Case #~d: ~a~%" i plaintext)))
(solution)
Feedback is welcome!
Matteo
--
Ma
ation from: read ciphertext as a string and then split it by
space, to call READ x times. I was lucky, but next time I am surely
going to remember about trying to GC instead.
Thank you,
Matteo
--
Matteo Landi
https://matteolandi.net
--
You received this message because you are subscribed to
ong (especially after you read the
analysis); however, putting that `(sb-ext:gc)` in there at the end of
each iteration really feels like cheating, but the grader would not
accept my solution for the hidden set without it, so ... feedback is
welcome!
Ciao,
Matteo
PS. I really miss https://www.
44 matches
Mail list logo
