Square Coins HDU-1398 母函数

HDU-1398

People in Silverland use square coins. Not only they have square shapes but also their values are square numbers. Coins with values of all square numbers up to 289 (=17^2), i.e., 1-credit coins, 4-credit coins, 9-credit coins, …, and 289-credit coins, are available in Silverland.
There are four combinations of coins to pay ten credits:

ten 1-credit coins,
one 4-credit coin and six 1-credit coins,
two 4-credit coins and two 1-credit coins, and
one 9-credit coin and one 1-credit coin.

Your mission is to count the number of ways to pay a given amount using coins of Silverland.

input

2
10
30
0

output

1
4
27

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 = 5e3 + 10;
const int UP = 17;

int a[18];
ll f1[N], f2[N];

inline ll solve(int n, ll res = 0) {
    for(int i = 0; i <= 500; ++ i) f1[i] = 1;
    for(int i = 2; i <= UP; ++ i) {
        for(int j = 0; j <= n; ++ j) {
            for(int k = 0; j + k * a[i] <= n; ++ k) {
                f2[j + k * a[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 --) {
        for(int i = 0; i <= 17; ++ i) a[i] = i * i;
        while(~scanf("%d", &n) && n) {
            printf("%lld\n", solve(n));
        }
    }
    return 0;
}