Please Login in order to post a comment
Can someone describe the problem more properly?
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.
Can someone tell me how to read input in java
I keep failing to parse the last test case. Does anyone have a clue about what's strange with it? I used the grammar in the description directly to generate my parser.
Can somebody explain the question please?