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.
I got it right, I still don t get how; checking possible integer solution defining a lowerbound got me only half right.
parcouring the farey tree worked, but when i check the number of iteration it looks actually worse for the tree method.
I got close to 10*7 iteration on 10*10 or n and 10**8 for d
anyway, i m glad it s done.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #71: Ordered fractions
You are viewing a single comment's thread. Return to all comments →
I got it right, I still don t get how; checking possible integer solution defining a lowerbound got me only half right. parcouring the farey tree worked, but when i check the number of iteration it looks actually worse for the tree method. I got close to 10*7 iteration on 10*10 or n and 10**8 for d anyway, i m glad it s done.