TLE in TAP2012B (Ball of reconciliation)

[daft_wullie]

To solve this problem within time limit I had to precompute the results and use this table within my code. But this approach is somewhat unsatisfying

Is it possible to find and implement a fast algo in python which gets AC?

Cheers daft

[francky]

In the comment, I can read :

2012-10-06 10:08:30 Francky
I have a 340B Py2 code AC in 0.08s, ... so it's better with a low limit code size.

I would like to see this problem with a small size code limit.
It's more interesting, we all agree with that.

Regards.

[daft_wullie]

Thanks for pointing this out.

Currently my code runs through the possible combinations for the numbers of dancers from Cubiconia, Quadradonia and Nlogonia, trying to skip combinations not suitable. Basically this is a nested loop through 2 variables for any given number of dances.

Is this a promising approach which only needs further optimization? Or is on the contrary a formula-based or recursive approach possible?

Thanks for any hints
Daft

[francky]

Thanks for pointing this out.

Currently my code runs through the possible combinations for the numbers of dancers from Cubiconia, Quadradonia and Nlogonia, trying to skip combinations not suitable. Basically this is a nested loop through 2 variables for any given number of dances.

Is this a promising approach which only needs further optimization? Or is on the contrary a formula-based or recursive approach possible?

Thanks for any hints
Daft

I did something like that, with good start and end points !!! Thats all.