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.
Project Euler #73: Counting fractions in a range
Project Euler #73: Counting fractions in a range
Contest ends in
You can find my java solution here
Solved this problem finally after a couple of failed trials.
For whomever it may help:
Good luck!
PS "Easy" is not the right category for this problem if you ask me...
What is the test case #10? I got a "wrong answer" for #10 only. Thanks!
can any one advice how to get better run time for gcd() function
even though i used the farey sequence in c my time hasent reduced. only 2 test case are accepted.