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.
One of the most hardest problem in Project Euler plus. There are so many edge cases, especially considering comparing continued fractions bounds. Anyway it's fully solvable.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #198: Ambiguous Numbers
You are viewing a single comment's thread. Return to all comments →
One of the most hardest problem in Project Euler plus. There are so many edge cases, especially considering comparing continued fractions bounds. Anyway it's fully solvable.