Can any one explain how to formulate a solution for this? I mean what is the algorithm and the premise?I've seen one top coders(jonick) solution and he solved it with dynamic programming all the way. But what is mystic for me is how was he able to find the relation between the current problem and the subproblem.
Specifically for the case of finding F(number of floors given the number of attempts and number of breakable eggs). His formula is res[i][j] =res[i-1][j-1] + res[i][j-1] + 1; // is the breakable eggs //j is the number of attempts Literally, Maximum floors now = Max floors at previous number of breakable eggs and attempts + max floors at current breakable eggs at previous number of attempts +1 The solution flowed perfectly... how did he come up with this relation. It all seems magic box to me. And he solved the other instances(finding D& B) using different relations and DP. Can some kind soul care to explain the algorithm/relation? On Fri, Sep 4, 2009 at 9:04 AM, romanr <[email protected]> wrote: > > Thank you! > I didn't notice that checkbox :) > > benetin wrote: > > Go to the scoreboard and select the file download mode. You can see > > all the solutions, and use them to run on the inputs. > > http://code.google.com/codejam/contest/scoreboard?c=32003#vf=1 > > > > On Aug 30, 7:12 am, romanr <[email protected]> wrote: > > > >> Hi all, > >> can anybody, who have solved Practice-C (Egg drop) problem, > >> send me right small & large output sets? > >> > >> Many thanks in advance. > >> I see impossibility in sample sets there, probably I'm misunderstanding > >> something... > >> > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
