hdu 1028

Problem Description
“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 <cstring>
using namespace std;
const int maxn = 120+20;
int v[maxn]={0,1};
void init()
{
    for(int i=2;i<121;i++)
    {
         v[i]=v[i-1]+1;
    }
}
int main()
{
    init();
    int a[maxn],b[maxn];
    int n;
    while(cin>>n)
    {
         memset(a,0,sizeof(a));
         a[0]=1;
         for(int i=1;i<=n;i++)
         {
             memset(b,0,sizeof(b));
             for(int j=0;j*v[i]<=n;j++)
                for(int k=0;k+j*v[i]<=n;k++)
             {
                 b[k+j*v[i]]+=a[k];
             }
             memcpy(a,b,sizeof(b));
         }
         cout<<a[n]<<endl;
    }


    return 0;
}