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.
A few test cases for n=5 or n=6 would have been nice.
My solution works for 1-22, and then fails for all else mostly with wrong answer (just a few with timeout). But it seems my solution gives the right answer for the original Project Euler 209 problem (n=6). So I really dont know where to go from here.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #209: Circular Logic
You are viewing a single comment's thread. Return to all comments →
A few test cases for n=5 or n=6 would have been nice.
My solution works for 1-22, and then fails for all else mostly with wrong answer (just a few with timeout). But it seems my solution gives the right answer for the original Project Euler 209 problem (n=6). So I really dont know where to go from here.