标签：hdu1398
Square Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7995 Accepted Submission(s): 5416
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
Sample Output
直接套模板。
#include <stdio.h>
#define maxn 302
int c1[maxn], c2[maxn];
int main()
{
int n, i, j, k;
while(scanf("%d", &n), n){
for(i = 0; i <= n; ++i){
c1[i] = 1; c2[i] = 0;
}
for(i = 2; i * i <= n; ++i){
for(j = 0; j <= n; ++j)
for(k = j; k <= n; k += i * i)
c2[k] += c1[j];
for(k = 0; k <= n; ++k){
c1[k] = c2[k]; c2[k] = 0;
}
}
printf("%d\n", c1[n]);
}
return 0;
}
HDU1398 Square Coins 【母函数模板】,布布扣,bubuko.com
HDU1398 Square Coins 【母函数模板】
标签：hdu1398
原文地址：http://blog.csdn.net/chang_mu/article/details/38125261
