Project Euler #115: Counting block combinations II

  • + 2 comments

    Hello, I'm using Java and have the problem, that the test cases except the first one always run out of time (>4s). I optimized my algorithm, now I can run 10^6 times a difficult input in time: (250000000000000 100000000000000000) Still the test cases don't finish.. I don't get what's different in these..

    Any hints or ideas what I'm missing? I really got stuck here..

    Thanks