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 #227: The Chase

# Project Euler #227: The Chase

Contest ends in

#### Sort by

recency

#### |

#### 13 Discussions

#### |

Please Login in order to post a comment

Looking back at this one, I believe it can be solved quickly for n < 10^18, m < 10^18, in O( log( n ) ).

Imagine a circle and person1 and person2 who have the dice and are sitting exactly opposite to each other on the left and write side of the circle. The probability of person1 rolling 1 and person2 rolling m, is equal to the probability of person1 rolling m and person2 rolling 1. That means the probability of each moving one step in the upper half of the circle (and therefore reducing the distance by two units) is equal to the probability of them doing the same thing in the lower half. And the same is true for other types of move (no passing and one to the right or left). Imho, the average is infinite.

how to read input from stdin.....i m using c language

From where the 675 and 44 are came from?

tym pass