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.
  • Hackerrank Home
  • Prepare
    NEW
  • Certify
  • Compete
  • Career Fair
  • Hiring developers?
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #227: The Chase
  4. Discussions

Project Euler #227: The Chase

Problem
Submissions
Leaderboard
Discussions

Sort 13 Discussions, By:

votes

Please Login in order to post a comment

  • datsko_d
    3 years ago+ 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?)

    4|
    Permalink
  • asdfyhsauiui
    3 years ago+ 1 comment

    From where the 675 and 44 are came from?

    1|
    Permalink
  • kmcshane
    1 year ago+ 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|
    Permalink
  • wiprosurya1999
    3 years ago+ 0 comments

    tym pass

    0|
    Permalink
  • moonpine1016
    3 years ago+ 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?

    0|
    Permalink
Load more conversations

Need Help?


View top submissions
  • Contest Calendar
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature