HDU 1028 Ignatius and the Princess III（母函数）

传送门

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

这个题有多种解法，可以dp，也可以搜索，也可以母函数，本文是用母函数解决的该问题。
首先有 N=a[1]+a[2]+a[3]+…+a[m];那么我们可以想到该个数字可以由1~N内的数字来构成。
那么N的方案数就是$(1+x+x^2+\cdots +x^n)\ast (1+x^2+x^4+\cdots +x^{2n})\ast \cdots \ast (1+x^n)$的$x^N$的系数，所以我们只需要计算出$x^N$的系数即可。

AC代码如下：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N(1e3);
int a[N],b[N];
int main()
{
	int n;
	while(cin>>n){
		memset(a,0,sizeof a);
		memset(b,0,sizeof b);
		b[0]=1;
		for(int i=1;i<=n;i++){
			for(int j=0;j<=n;j++)
			{
				for(int k=0;k<=n-j;k+=i){
					a[j+k]+=b[j];
				}
			}
			for(int j=0;j<=n;j++){
				b[j]=a[j];
				a[j]=0;
			}
		}
		cout<<b[n]<<endl;
	}
	return 0;
}