Project Euler #209: Circular Logic

Sort by

recency

|

11 Discussions

|

  • + 0 comments

    Can someone describe the problem more properly?

  • + 0 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.

  • + 1 comment

    Can someone tell me how to read input in java

  • + 2 comments

    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.

  • + 1 comment

    Can somebody explain the question please?