Wow! This problem is kind of tricky. If you're ready to put your thinking cap on, brace yourself and good luck! Otherwise, you can skip it for now and return any time later
Each number can be broken down into parts, or addends. For example, number 3 may be broken down into such addends as 1 + 1 + 1, 2 + 1, 3. This procedure is known as decomposition.
In this task, you'll need to find out all decompositions of number () and list its positive addends. The decomposition should be printed in lexicographical order. For example:
1 1 1 1 1
2 2 1
3 1 1
...
Each decomposition should consist of the addends in a descending order, where each subsequent number of the list is equal or less than the previous one.
Tip: Note, that inversion of addends doesn't count and 2 + 1 and 1 + 2 are the same operations.
0 is not a positive number.
