You cannot post messages because only members can post, and you are not currently a member.
Description:
A group for discussion of the Google Code Jam series of programming contests.
To learn more, visit http://code.google.com/codejam.
Please refrain from making any commercial or recruiting posts on this list.
|
|
|
Round 2 : enjoyed.... but alas....
|
| |
The last problem D large input could not be solved by anyone....
They could have solved it , if they would have had answered my
questions..... :p
|
|
|
any good java coder here.....
|
| |
why it is that sometimes java just gives up....
the problem statement is here :
[link]
my solution at the below link :
atleast when the loop finishes it must termininate but what the hell is in
the below link code ,,,
it works for small matrix upto 6x6 but 7x7 and above it just dies out... more »
|
|
|
matrix traversesal of larger dimension ??? plz help
|
| |
how do i traverse a 2d matrix of larger dimension ( say 1000x1000 ). i
used dfs that showed correct answer for smaller dimension matrix but
when larger dimension matrix came then error popped up "Stack over
flow .. :( "
|
|
|
DP approach
|
| |
Hi all genius minds.
I have a small algorithm question. Any help will be appreciated.
Suppose there is a lake (some height lh) and then there are hills/mountains
(with height from 0 to 9).
And finally there is Dam. All the hills and the lake and the dam are on a
n*m matrix.
given the height of all points on matrix (lake and dam are also on one such... more »
|
|
|
unsolvable problem
|
| |
Please help me solve this problem for cases with high number of nodes. I am
getting time limit exceeded.
Ms.Kox enjoys a nice job of her interest, but she does not like to waste
much time on going-to/coming-from office. She is now aware of the route to
her office that has the smallest distance, after all she has been working... more »
|
|
|
