母函数

Ignatius and the Princess III

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 15 Accepted Submission(s) : 15
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<bits/stdc++.h>
using namespace std;
int c1[100000],c2[100000];
int main(){
	int n;
	while(cin>>n){
		for(int q=0;q<=n;q++){
			c1[q]=1;
			c2[q]=0;
		}
		for(int q=2;q<=n;++q){//表示第几个括号
			for(int w=0;w<=n;++w){
				for(int e=0;w+e<=n;e+=q){//e+=q表示x^0,x^q,x^2+q..x^(n*q);
					c2[w+e]+=c1[w];//组成w+e的种数=w+e原有的种数+组成w的种数；
				}
			}
			for(int w=0;w<=n;++w){
				c1[w]=c2[w];
				c2[w]=0;
			}
		}
		printf("%d\n",c1[n]);
	}
	return 0;
} ```