You are viewing a single comment's thread. Return to all comments →
Keyword for this problem is integer partition algorithm.
There are many unreliable codes in the internet, so you should choose the one that has time = O(n^1.5)
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #78: Coin partitions
You are viewing a single comment's thread. Return to all comments →
Keyword for this problem is integer partition algorithm.
There are many unreliable codes in the internet, so you should choose the one that has time = O(n^1.5)