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
  • Practice
  • Certification
  • 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
    2 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
    2 years ago+ 1 comment

    From where the 675 and 44 are came from?

    1|
    Permalink
  • kmcshane
    2 weeks ago+ 0 comments

    Looking back at this one, I believe it can be solved almost instantaneously for n < 10^18, m < 10^8.

    0|
    Permalink
  • emad_aghili
    2 years ago+ 1 comment

    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.

    0|
    Permalink
  • wiprosurya1999
    2 years ago+ 0 comments

    tym pass

    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