Ordered fractions
This problem may be bruteforced. But if the number N is huge(1E15), bruteforce is impossible. The math concept under this problem is called the farey sequence. Once the basic property between neighbors is understood, the problem is easy to figure out. even if N is huge like those in projectEuler+.
No comments:
Post a Comment