hdu 1398 Square Coins
2016-03-07 16:28
417 查看
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
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
#include<stdio.h> #include<iostream> #include<string.h> #include<algorithm> using namespace std; int main() { int a[500],b[500],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*i<=n;i++) //根据情况进行变换(i*i<=n) { for (j=0;j<=n;j++) for (k=0;k+j<=n;k+=i*i) b[k+j]+=a[j]; //这两个for循环将i的一种情况进行了统计 for (j=0;j<=n;j++) { a[j]=b[j]; //进行传值,并将b数组清零 b[j]=0; } } printf("%d\n",a ); } return 0; }
相关文章推荐
- 51nod 1081 子段求和
- Log4j使用总结(全面)一
- vs2010发布时去除msvcp100.dll和msvcr100.dll
- 该日是该年的第几天
- (EM算法)The EM Algorithm
- 对于账务系统开发的一点儿理解
- C/S程序对于大数据量浏览的解决方案
- log4j中Logger.getLogger与LogFactory.getLog的区别
- Android 本地加载网页&显示网络图片
- android大众常用的五种布局
- 哈希索引和B+树索引的区别
- GridView vs ListView
- 1107. Social Clusters (30)
- iOS UITableViewCell透明度 和 cell文字居中
- QQ聊天界面实现
- 数据库增删改查语句学习
- VS2010 MFC显示位图
- 地图上显示div点位
- 2048小游戏——网页版(基础篇)
- Core Data