I don't understand how 7 is achieved for max F in the first test case. Since S(3,3,3) is true, it is determined that within three drops, allowing 3 breaks, it's known whether or not the egg will break at all floors less than or equal to 3. Right?
The leap to 7 is foggy for me. I could see the answer being 6, as with three drops we could check 4,5, and 6. I know i'm missing something but I don't know what it is. I'll admit it's a little frustrating ;) Sent on the TELUS Mobility network with BlackBerry -----Original Message----- From: Paul Smith <paulsmithena...@gmail.com> Date: Tue, 8 Sep 2009 14:45:39 To: <google-code@googlegroups.com> Subject: [gcj] Re: Egg Drop The sample input has 2 test cases. The first, 3 3 3, tell you that Solvable(3,3,3) is true. So, you are asked, what is the maximum number F such that Solveable(F,3,3) is true, what is the minimum number D such that Solveable(3,D,3) is true, what is the minimum number B such that Solveable(3,3,B) is true. The answer for this case is 7 2 1, as S(7,3,3), S(3,2,3) and S(3,3,1) are all true. Similarly, given that S(7,5,3) is true, S(25, 5, 3), S(7,3,3) and S(7,5,2) are all true, 7 5 3 -> 25 3 2 On Tue, Sep 8, 2009 at 1:48 PM, LeppyR64<jlep...@gmail.com> wrote: > > I'm having trouble understanding the problem statement. > > I understand what is expected for output, but not how to get from the > sample input to the output. > Could someone please explain the sample test case? > > > -- Paul Smith http://www.nomadicfun.co.uk p...@pollyandpaul.co.uk --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to google-code@googlegroups.com To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/google-code?hl=en -~----------~----~----~----~------~----~------~--~---
