Parveen, take that specific line and place it on top of the input file
so that you get convinced :)
On Sun, Apr 28, 2013 at 1:40 PM, Andrey Ponomarev
ponomarev@gmail.com wrote:
Isn't that a case that your algorithm performs, say, k iterations where k is
the result that you are going to
How familiar are you with the topic?
On Thu, Apr 25, 2013 at 12:26 AM, Vincent Dirie vranz...@gmail.com wrote:
Introduction to Algorithms
this has an extensive introduction to Dynamic programming. here is the link
You want to look for a number that its square is below 16. Do you have
to go up to 16 or you may stop at the square root of 16. Can you come
up with a number larger than 4 that has a square less than 16?
That's the same for the large test case, the biggest a number can be
is 10^14 but can you
Just an advice, especially when you want someone else to read your
code, try to make your variable names meaningful and put comments that
explain what every part is supposed to do, I guarantee you will get
faster response and will even encourage you to debug your code
yourself :)
On Wed, Mar 13,
, Mar 13, 2013 at 9:41 PM, ayman bs ammoun2...@gmail.com wrote:
Just an advice, especially when you want someone else to read your
code, try to make your variable names meaningful and put comments that
explain what every part is supposed to do, I guarantee you will get
faster response and will even
it's giving error that output should start with case
#1: , eventhough my output is giving case 1#
I didn't look at code yet :-)
On Sat, Apr 23, 2011 at 8:31 AM, chase studious.hem...@gmail.com wrote:
sir, my code for the problem reverse string link ::
For being Bartholomew coworker too :D
On Fri, Nov 12, 2010 at 8:39 PM, Leopoldo Taravilse ltaravi...@gmail.comwrote:
Congratulations Jorge! (for starting working at Google)
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this
Bharath, I think the same, and here is a proof.
http://ideone.com/jUcdS
On Wed, Aug 4, 2010 at 7:05 PM, Bharath Raghavendran
rbharat...@gmail.comwrote:
I think when you do c++ from 255, it will go to 0 and not 256 (bcoz its
unsigned char).
Hence, the condition c=255 is always satisified and
You should explain the problem the way you understood it, and probably
provide the output you expected.
On Fri, May 21, 2010 at 9:58 AM, bluelf bahular...@gmail.com wrote:
hey ,
i was just looking at some previous years problems . . here in this
one, we have to find smallest common happy no.
Apparently, it's just crawling the available webpages via Get requests, and
then genrate those statistics... (This is my personal opinion).
On Fri, May 14, 2010 at 10:52 PM, vivek agarwal koolvivek2...@gmail.comwrote:
yeah I still wonder the go-hero site which provides the details and
In contest, some problems will produce Timed out message with large input,
so I don't advise you to go with this assumption :D
On Sat, Apr 17, 2010 at 7:32 PM, Gustavo Pacianotto Gouveia
gustavo.paciano...@gmail.com wrote:
for google servers, all algorithms are O(1)
2010/4/17 Jacob Lyles
The problem says:
In order to insert two characters in sequence from the same key, the user
must pause before pressing the key a second time.
You're trying to make assumptions based on the picture, although it was just
for illustrating purpose as far as I know...
On Thu, Apr 8, 2010 at 2:54
I couldn't understand what exactly you are looking for...
2009/11/28 Абзал Сереков abzal.sere...@gmail.com
hello everybody, who knows how to submit problems in TopCoder
such as on C++ problem for finding sum of two integers
like this:
5 4
9
or can you write solution of one easy problem
13 matches
Mail list logo
