母函数模板分析

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[200], c2[200], num[200], elem[200]={1},n,i,j,k;//num为数量，elem为元素，num本题暂时省略，母函数中大多要用到
int main() {
	while (cin >> n) {
		memset(c1, 0, sizeof(c1));//c1为当前各次数前的系数
		memset(c2, 0, sizeof(c2));//c2暂时保存系数
		for (i = 0; i <= n; i++)//初始化第一个元素所组成的各种情况，n根据情况改写
			c1[i] = 1;
		for (i = 2; i <= n; i++) {//从第二项开始合并括号
			for (j = 0; j <= n; j++) {第一个括号的遍历
				for (k = 0; k + j <= n; k+=elem[i]) {第二个括号遍历,此处elem恒为1
					c2[k + j] += c1[j];//c2暂时保存系数
				}
			}
			for (j = 0; j <= n; j++)
			{
				c1[j] = c2[j];//值给c1
				c2[j] = 0;//清空c2
			}
		}
		cout << c1[n] << endl;//指数为n的系数，即n可拆分为多少的总方案数
	}
	return 0;

}