HDU 1398 Square Coins

Square Coins

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Problem Description

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

The input consists of lines each containing an integer meaning an amount to be paid, followed by a line containing a zero. You may assume that all the amounts are positive and less than 300.

Output

For each of the given amount, one line containing a single integer representing the number of combinations of coins should be output. No other characters should appear in the output. 

 

Sample Input

2 10 30 0

 

Sample Output

1 4 27

 

Source

Asia 1999, Kyoto (Japan)

 

Recommend

Ignatius.L   |   We have carefully selected several similar problems for you:  2152 1709 2079 2069 2110 

 

Statistic | Submit | Discuss | Note

生成函数，问用一些有使用次数限制的数字能组合出某个数字的方案数。

#include <cstdio>
#include <cstring>

template <class T>
inline void read(T &x)
{
    x = 0;
    char c = getchar();
    while (c < 48)c = getchar();
    while (c > 47)x = x*10 + c - 48, c = getchar();
}

const int siz = 305;
const int lim = 300;

int n;
int f[siz];
int s[siz];
int t[siz];

signed main(void)
{
    f[0] = 1;
    
    for (int i = 1; i <= 17; ++i)
    {
        memset(s, 0, sizeof s);
        memset(t, 0, sizeof t);
        
        for (int j = 0; j*i*i <= lim; ++j)
            s[j * i * i] = 1;
        
        for (int j = 0; j <= lim; ++j)if (s[j])
            for (int k = 0; k <= lim; ++k)if (f[k])
                t[j + k] += s[j] * f[k];
        
        memcpy(f, t, sizeof f);
    }
    
    while (read(n), n)printf("%d
", f[n]);
}

@Author: YouSiki