We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.

# Project Euler #121: Disc game prize fund

# Project Euler #121: Disc game prize fund

Contest ends in

#### Sort by

recency

#### |

#### 11 Discussions

#### |

Please Login in order to post a comment

I had the correct algorithm, but was getting failure on test 3. Now that I fixed the problem, I realize that the issue was all due to not handling the integer division with enough precision for the larger N values. To get around that, I used the python fraction library. Here's the code:

for 5 turns..what will be the probability of winning ??

i have my case 2terminated due to time

I have my test #2 and #3 wrong, but I am almost sure than I am doing everything correctly.

I even checked the int overflow (2^32) and change it to BigDecimal, remove the scientific notation to display out as "single integer".

Can someone check my result for the first N 10 cases? 1 = 1 (2/1=2 this would be no loss no gain,so -1), 2 = 5 (6/1=6 this would be no loss no gain,so -1), 3 = 3 (24/7), 4 = 10 (120/11), 5 = 7 (720/101), 6 = 25 (5040/197), 7 = 17 (40320/2311), 8 = 70 (362880/5119), 9 = 49 (3628800/73639), 10 = 225 (39916800/177299),

Still can't figure out what i am doing wrong or how to debug it. I would love some guidance, thanks in advanced :)

I think that for finding the prize we need to devide denominator by numerator. But i got my test 2 and 3 wrong.