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
+ 1 comment Can someone explain me the task? What do p and q mean? And why does the answer exist(what if on every step they both roll neither 1 nor m?)
+ 1 comment From where the 675 and 44 are came from?
+ 0 comments Looking back at this one, I believe it can be solved quickly for n < 10^18, m < 10^18, in O( log( n ) ).
+ 0 comments tym pass
+ 1 comment The only problem is that I don't know how the hell is 675/44 = 113636380 (mod 10^9 + 9).
Could anyone give me an example about how to magically turn 675 and 44 into 113636380?
Load more conversations
Sort 13 Discussions, By:
Please Login in order to post a comment