Problem 590. Greed is good - Simple partition P[n].
Find a simple partition P[n].
E.g. P = 4 + 3 + 2 + 1.
- There are many solutions, compute just one set.
- Don't repeat numbers.
- Be Greedy ;-)
- To check against trivial solutions, E.g. [x-k, k] etc;
but I'll provide you with one to start.
- Show me how you write the whole solution.
Bonus points if you solve the general problem of producing all unique partitions of [n].