Project Euler Forum

Problem 782 (View Problem)
My algorithm can solve most the examples, but I have written this twice now and both ways I get C(20) = 1144, which is 6 below the minimum of the example. Obviously I am not getting the right solution for C(10^4).
It would be appreciated if someone can check if I am on the right track with my logic by letting me know which values of c(20,k) are out, so I can check my logic.
Thanks in advance
David

I think it would be too revealing to say which values are wrong or even how many are wrong. So instead I would suggest that you also construct and examine the matrices that purportedly witness your claimed values of $c(n,k)$ to identify those values yourself.

Thank you. I have constructed the matrices as suggested, and have identified some issues. I am now getting C(n,k) slightly greater than some of the examples so I don't think I have my logic incorrect now, I just haven't found all the minimums yet...

C(10,31)=3 Is it correct? Thank you

I feel $c(10,31)$ is be closer to being a hint rather than a clarification. As the problem states, you'll have to demonstrate it is possible achieve $c(10,31)$ complexity, but not any lower. If it helps clarify, the rows are read left to right and the columns are read top to bottom.

C(10^2)=30426 Is it right ?

It is not correct