HDU-1208 Ignatius and the Princess III

算法参考：https://blog.csdn.net/xhpakill/article/details/51251172

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 27426    Accepted Submission(s): 18853

题目描述：

"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says. 

"The second problem is, given an positive integer N, we define an equation like this: 
  N=a[1]+a[2]+a[3]+...+a[m]; 
  a[i]>0,1<=m<=N; 
My question is how many different equations you can find for a given N. 
For example, assume N is 4, we can find: 
  4 = 4; 
  4 = 3 + 1; 
  4 = 2 + 2; 
  4 = 2 + 1 + 1; 
  4 = 1 + 1 + 1 + 1; 
so the result is 5 when N is 4. Note that "4 = 3 + 1" and "4 = 1 + 3" is the same in this problem. Now, you do it!" 

Input

The input contains several test cases. Each test case contains a positive integer N(1<=N<=120) which is mentioned above. The input is terminated by the end of file. 

Output

For each test case, you have to output a line contains an integer P which indicate the different equations you have found. 

Sample Input

4
10
20

Sample Output

5
42
627

---

整数拆分

---

代码：

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

int ans[1006];

int main()
{
    int n;
    while(~scanf("%d", &n))
    {
        memset(ans, 0, sizeof ans);
        ans[0] = 1;
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= n; j++)
            {
                if(i <= j)
                    ans[j] += ans[j - i];
            }
        }
        printf("%d\n", ans[n]);
    }
    return 0;
}