http://groups.google.com/group/google-code/browse_thread/thread/6570b0ca618697b/8c251a4e8772612?q=#08c251a4e8772612
On Aug 16, 3:08 pm, Kaushalya Madhawa <[email protected]> wrote: > Hi,I also had the same problem. > Are there explanations for GCJ practice problems and beta problems? > > Regards, > Kaushalya > Madhawahttp://kaumad.wordpress.comhttp://most-wanted-stuff.blogspot.com > > twitter:http://twitter.com/kau_mad > skype: kau.mad > gtalk: kau.mad > > On Sun, Aug 16, 2009 at 2:17 AM, Bartholomew Furrow <[email protected]>wrote: > > > Link to Egg Drop: > >http://code.google.com/codejam/contest/dashboard?c=agxjb2RlamFtLXByb2... > > > On Sat, Aug 15, 2009 at 12:23 PM, algo.maniac <[email protected]>wrote: > > >> 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 -~----------~----~----~----~------~----~------~--~---
