HDU 1028 Ignatius and the Princess III|母函数

母函数裸题..套模板就OK

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<iostream>
#include<algorithm>
using namespace std;
int c1[122],c2[122];
int main()
{
    int n;
    while(cin>>n)
    {
        for(int i=0;i<=n;i++)
            c1[i]=1,c2[i]=0;
        for(int i=2;i<=n;i++)
        {
            for(int j=0;j<=n;j++)
                for(int k=0;k+j<=n;k+=i)
                    c2[k+j]+=c1[j];
            for(int j=0;j<=n;j++)
                c1[j]=c2[j],c2[j]=0;
        }
        cout<<c1[n]<<endl;
    }
    return 0;
}