There is something unclear in the problem description. It says the eggs are almost identical (emphasis added), meaning they are not identical, so tries with one egg would not apply to another one: any series of try with one egg is independent from the series with another egg. Is this actually what is meant here ? In the issues thread, someone claims to assume they are actually identically behaving.
Okey. I got stuck with this. If you have only two eggs and m tries it always must be Math.Pow(2,n-1)*m or something similiar because you need go in this pattern then: 2,4,6,8 and when the egg gets crashed you can go one floor back.
Same with three eggs : Math.Pow(2,n-1)*m -> 4 8 12 16 20 . If 20 is to big you go 18 and then 19 or 17. How i am wrong ?
@ice1000 when so many people don't even understand what the kata is about, maybe the problem is not on them.
It has nothing to do with grammar, it's just really poorly explained.
I hope you would have got that now, please tell me if yes.
What is your approach? If you use doubles instead of big integers you obviously will have precision problems
I don't think it's very realistic. If you drop an egg it surely gets some microtrauma even if it doesn't crack, making it more susceptible to crack in another throw.
i think % error for answers should be added. the numbers are so big so if the error would be less than 0.0001% answer should be accepted. my code on last test returns answer with error 0.000000000000048%
This comment is hidden because it contains spoiler information about the solution
Somebody can tell me if this problem is related with any situation in practice life. I haven't solve it yet, maybe that's why I don't see
the point with this problem.
C# Translation added.Please review and approve it~
I really don't understand where to start with this, given the . number of eggs and tries, how can I possibly know the height of the floors?
You get that when your code takes too long.
Hi, for the Haskell version, there is a typo in the function name: heigth should be height