本文共 1459 字，大约阅读时间需要 4 分钟。
Square Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4146 Accepted Submission(s): 2817 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.
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.
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.
#include<stdio.h>
main()
{
int c1[305],c2[305],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<=17;i++)
{
for(j=0;j<=n;j++)
{
for(k=0;k+j<=n;k+=i*i)
{
c2[k+j]+=c1[j];
}
}
for(j=0;j<=300;j++)
{
c1[j]=c2[j];
c2[j]=0;
}
}
printf("%d\n",c1[n]);
}
}
转载地址：http://attpi.baihongyu.com/