hdu -1028 gnatius and the Princess III 母函数

zhan-z

于 2019-10-19 21:08:12 发布

阅读量121

点赞数

本文链接：https://blog.csdn.net/qq_40962234/article/details/102643099

版权

"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 <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int x[125], xt[125];
int main(){
    int n;
    while(~scanf("%d",&n)){
        for(int i=0; i<=n; i++) xt[i]=1, x[i]=0;
        for(int i=2; i<=n; i++){
            for(int j=0; j<=n; j++)
                for(int k=0; k<=n; k+=i)
                    if(xt[j]) x[j+k]+=xt[j];
            for(int j=0; j<=n; j++) xt[j] = x[j], x[j]=0;
        }
        printf("%d\n",xt[n]);
    }
    return 0;
}