hduoj1398(Square Coins)
来源:互联网 发布:cygwin 连接linux 编辑:程序博客网 时间:2024/06/06 12:24
Square Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8882 Accepted Submission(s): 6059
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.
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
210300
Sample Output
1427
//#include<iostream>//using namespace std;
#include<stdio.h>
int main(){
int a[350],b[350],i,j,k,n;
while(scanf("%d",&n),n)
{
for(i=0;i<=n;i++)
{
a[i]=1;
b[i]=0;
}
for(i=2;i<=17;i++)
{
for(j=0;j<=n;j++)
for(k=0;k+j<=n;k+=i*i)
b[k+j]+=a[j];
for(j=0;j<=n;j++)
{
a[j]=b[j];
b[j]=0;
}
}
printf("%d\n",a[n]);
}
return 0;
}
0 0
- hduoj1398(Square Coins)
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- hdu 1398Square Coins
- 1398 Square Coins
- zoj 1666 Square Coins
- HDOJ Square Coins
- hdu 1398 Square Coins
- [Perforce]password (P4PASSWD) invalid or unset. 的错误解决
- 信号量、互斥体和自旋锁
- 提高查询性能01
- SQL第十四章
- JDK和JRE
- hduoj1398(Square Coins)
- 链式队列C++实现
- hdu 1076 水
- SQL第十三章内连接
- python基础 - lambda关键字
- 如何从DataList控件中读取某控件的数据。
- 分区并行化物化视图
- 【COCOS2DX-游戏开发之八】点击空白隐藏键盘
- sqlite1-1