Ignatius and the Princess HDU-1028 母函数

HDU-1028

“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!”

$多组输入，N<120$

input

4
10
20

output

5
42
627

code

//Siberian Squirrel
//#include<bits/stdc++.h>
#include<unordered_map>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cmath>

#define ACM_LOCAL

using namespace std;
typedef long long ll;

const double PI = acos(-1);
const double eps = 1e-7;
const int MOD = 3221225473;
const int N = 5e6 + 10;
const int UP = 130;

ll f1[UP], f2[UP];

inline ll solve(int n, ll res = 0) {
    for(int i = 0; i <= n; ++ i) f1[i] = 1;
    for(int i = 2; i <= n; ++ i) {
        for(int j = 0; j <= n; ++ j) {
            for(int k = 0; j + k * i <= n; ++ k) {
                f2[j + k * i] += f1[j];
            }
        }
        for(int j = 0; j <= n; ++ j) f1[j] = f2[j], f2[j] = 0;
    }

    return f1[n];
}

int main() {
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
#endif
    int o = 1, n;
//    scanf("%d", &o);
    while(o --) {
        while(~scanf("%d", &n)) {
            printf("%lld\n", solve(n));
        }
    }
    return 0;
}