You are viewing a single comment's thread. Return to all comments →
This may help you. https://www.geeksforgeeks.org/modular-division/
Note: the C++ code will overflow 32 bit ints when using modulo 10^9+9, so I suggest you replace ints with longs.
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #227: The Chase
You are viewing a single comment's thread. Return to all comments →
This may help you. https://www.geeksforgeeks.org/modular-division/
Note: the C++ code will overflow 32 bit ints when using modulo 10^9+9, so I suggest you replace ints with longs.