http://mirror.codeforces.com/contest/472/problem/C

i dont understand the second test case. whatever handle we choose, the order will always be 2 3 1, the how the answer for 3 1 2 can be yes?

It is possible to write five as a sum in exactly six different ways:

4 + 1 3 + 2 3 + 1 + 1 2 + 2 + 1 2 + 1 + 1 + 1 1 + 1 + 1 + 1 + 1

How many different ways can one hundred be written as a sum of at least two positive integers?

i am looking for a top-down recursive solution. thanx.

i want to solve this problem with DP http://mirror.codeforces.com/contest/180/problem/C there is no editorial for it. thanks for helping. i already soled it other way.