HDU Ignatius and the Princess III (母函数)

 1 /*
 2     母函数模板
 3     http://blog.csdn.net/vsooda/article/details/7975485  详解 
 4 */
 5 #include<cstdio>
 6 #include<iostream>
 7 #define MAXN 121
 8 
 9 using namespace std;
10 
11 int c1[MAXN];
12 int c2[MAXN];
13 
14 int n;
15 
16 int main() {
17     while(~scanf("%d",&n)) {
18         for(int i=0;i<=n;i++) {
19             c1[i]=1;c2[i]=0;
20         }
21         for(int i=2;i<=n;i++) {
22             for(int j=0;j<=n;j++)
23               for(int k=0;k+j<=n;k+=i)
24                 c2[j+k]+=c1[j];
25             for(int j=0;j<=n;j++) {
26                 c1[j]=c2[j];
27                 c2[j]=0;
28             }
29         }
30         printf("%d\n",c1[n]);
31     }
32     return 0;
33 }