利用非递归算法将正整数n表示成一系列正整数之和，n=n1+n2+...+nk，其中n1>=n2>=n3>=...>=nk>=1，k>=1。



正整数n的这种表示称为正整数n的划分。

-N represents a positive integer into a series of positive integers and the use of a non-recursive algorithm, n = n1+n2+ ...+nk, wherein n1 = n2 = n3 = ...>　= nk>　= 1, k>　= 1. The positive integer n such means as framing the positive integer n.