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 #66: Diophantine equation
  4. Discussions

Project Euler #66: Diophantine equation

Problem
Submissions
Leaderboard
Discussions

Sort 10 Discussions, By:

votes

Please Login in order to post a comment

  • stbrumme
    5 years ago+ 1 comment

    Wikipedia has a long article about this problem: https://en.wikipedia.org/wiki/Pell%27s_equation

    5|
    Permalink
  • micsthepick
    5 years ago+ 0 comments

    I finally got my solution to work. It was taking too long on the last two cases. Turns out that manual calculation was faster than using python's fractions library.

    2|
    Permalink
  • devanshsehta
    3 years ago+ 0 comments

    Is there a way for you to see the time taken by your code in each test case? I am a noobie and I like to know how fast the computer can crunch the numbers.

    1|
    Permalink
  • [deleted] 8 years ago+ 1 comment

    why this problem has been tagged as "Easy"??

    1|
    Permalink
  • yeyejyf
    7 years ago+ 0 comments

    when D = 61, it looks like the minimal x is 1766319049. It is really too crazy to iterator until this digit

    0|
    Permalink
Load more conversations

Need Help?


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