Ignatius and the Princess III （HDU-1028）（母函数）

"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

题意：给定整数n，求n有多少种划分方式。（对于4来说，1+3和3+1是同一种划分方式）

思路：这道题的话，是一道简单的母函数题，关于母函数的详情：传送门

AC代码：

#include <bits/stdc++.h>
typedef long long ll;
const int maxx=10010;
const int inf=0x3f3f3f3f;
using namespace std;
int sup[maxx],temp[maxx];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=0; i<=n; i++)
        {
            sup[i]=1;
            temp[i]=0;
        }
        for(int i=2; i<=n; i++)//操作第i个括号
        {
            for(int j=0; j<=n; j++)//对于指数为j的进行操作
            {
                for(int k=0; k+j<=n; k+=i)//把第i个的每一个数与之前的结果相乘
                {
                    temp[j+k]+=sup[j];//j+k指数相加，他的值就是这个指数的系数
                }
            }
            for(int j=0; j<=n; j++)//系数保存在前面一个数组中
            {
                sup[j]=temp[j];
                temp[j]=0;
            }
        }
        printf("%d\n",sup[n]);
    }
    return 0;
}