Hi, I have recently registered for google codejam and practicing last year codejam problems. Although I have the solution code for the problems I dont have the explanation to it.
Is there any place where I can find the explanation for the problems and their solutions? To be specific I am presently looking for the explation of the problem : egg drop. In code I found they used some algo using F(D,B) = F(D-1,B) + F (D-1,B-1) + 1. But how this recursive function solve the problem? Now if I will have 1 total eggs and 1 egg I can break then the Fmax should always be infinity because It may be possible that that the egg may be strong enough that it will not break from top floor also. Can anybody help If I am understanding it wrongly? --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/google-code?hl=en -~----------~----~----~----~------~----~------~--~---
