AM, Atanas Banov ent...@gmail.com wrote:
dict uses trees, in what language that?
seems you are mistaken, dictionaries *are* hashes
On Sun, May 23, 2010 at 1:19 AM, Mikhail Dektyarev
mihail.dektya...@googlemail.com wrote:
As I know, dict uses trees, not hashes.
And to find the right size
As I know, dict uses trees, not hashes.
And to find the right size is not difficult. 501x501 will be enough, filling
with 0 by default.
On Sun, May 23, 2010 at 12:17 PM, Atanas Banov ent...@gmail.com wrote:
errr, no. hash lookup is O(1), not log... you are thinking balanced trees
or some such.
calculate nCr using a dynamic programming type algo as nCr =
n-1Cr +
n-1Cr-1.
calculate for largest possible n once .. and once thats done, getting
this
value would be O(1). Calculating factorial of 500 looks scary
On 23 May 2010 13:49, Mikhail Dektyarev
mihail.dektya...@googlemail.com
Yes, python is great. But my algorithm for problem C need 4 minutes on my
machine. So I was forced to generate all possible answers before downloading
large input.
I hope, solution like
answers = [0,0,1,2,3,...]
with commented right algorithm is OK?..)
On Sat, May 22, 2010 at 11:56 PM, Chris
Correct output is
Case #1: 1
because we need to create catalog /home/x
On Sat, May 22, 2010 at 11:55 PM, Paulo Cezar Pereira Costa
knight...@gmail.com wrote:
I was taking a look at Gluk's code for problem A,
seems like his code generate a wrong output, or I didn't understood the
problem
I think, time travel is enough to receive a Nobel prize. But GCJ is
algorithm competition, and I think is is unfairly to win it using time
travel.
On Sun, May 23, 2010 at 2:36 AM, Carlos Guia zyx3d...@gmail.com wrote:
I think if you used time travel you should be declared the winner right
May be, he produced the wrond source code for small input. Then he could
solve large input, but after contest his small input solution was marked as
incorrect and he lost 10 points.
On Sun, May 16, 2010 at 7:50 PM, Felipe Sodré Silva fso...@gmail.comwrote:
The problem is that the rules say
Or, as was suggested many times, try a better algorithms:)
On Wed, May 12, 2010 at 11:04 AM, basheer jan janbash...@gmail.com wrote:
try a better compiler/assembler rather than upgrading the system.
-- Forwarded message --
From: tonka ritwik.sami1...@gmail.com
Date: Mon, May
Dates are listed at http://code.google.com/codejam/schedule.html
I don't think that Google will change it
On Tue, May 11, 2010 at 10:02 AM, Goel_Ayush ayushgoel...@gmail.com wrote:
I just wanted to ask that the dates for round 2 are decided by us or
Google sends us the dates. If Google sends
To delete a friend, click a star near his nick.
On Wed, May 12, 2010 at 6:39 AM, Mohamed Ghoneim ghooo.gh...@gmail.comwrote:
Dear all,
in the friend list at the scoreboard page,
why i am only limited to have only 30 friends at a time?
and how can i delete someone i have added as a friend?
As somebody wrote last year after round 2:
I vote for everybody in the world except top-500 from round 2 to get the
t-shirt
On Mon, May 10, 2010 at 3:50 PM, Amit Agarwal lifea...@gmail.com wrote:
I was just wondering that do I get the t-shirt if I qualified. :P
-Regards
Amit Agarwal
You forgot 2 solutions.
X. O(N^2) - calculate next[i] and value[i] for O(N^2), then find a cycle for
O(N) and what happens before it for O(N).
Y. O(NlogN) - as previous, but calculate next and value for O(NlogN)
On Sun, May 9, 2010 at 10:47 AM, guest naieel...@gmail.com wrote:
Well, I've
Is you use double, then are you sorry that your answer is exact?
On Mon, May 10, 2010 at 1:10 AM, Abdelrhman Abotaleb
profvip.abota...@gmail.com wrote:
I think it's related to the output format
in c++ I'm casting the double to long integer so that the answer is exact
without floating point
Hi.
I think, my solution for Problem C will work not correctly, if R (number
of step when we enter to a cycle).
But I couldn't find an example, when we enter to a cycle later then after
the first running. In small and large inputs there is no such example, too.
Can anybody find it, or it doesn't
If you have a way to read one and only one case - you'll simple read tests
until the end of file.If no - there is no way to do it.
On Thu, Oct 1, 2009 at 7:58 PM, kumaran arumugam amk1...@gmail.com wrote:
Hw to accept multiple test cases as input when the number of test
cases is not known..?
I think, it is a good idea:)On eBay invite cost is currently US
$157http://cgi.ebay.com/ws/eBayISAPI.dll?ViewItemItem=180413798949Category=80269_trkparms=algo%3DLVI%26its%3DI%26otn%3D2#ht_500wt_1182:(
I requested for account at the next day after presentation but didn't
received anything.
Did
I vote for 3001 to get it:)
On Sun, Sep 27, 2009 at 11:53 AM, liang yu iamyuli...@gmail.com wrote:
I prefer all the 3000:)
On Sun, Sep 27, 2009 at 3:50 PM, Huy Phan dac...@gmail.com wrote:
well T-shirt is kind of certificate, isn't it ?
You can not bring your certificate paper to
17 matches
Mail list logo
