HDU1398-Square Coins
来源:互联网 发布:中美7.13南海对峙知乎 编辑:程序博客网 时间:2024/04/29 23:02
Square Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11372 Accepted Submission(s): 7792
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
Source
Asia 1999, Kyoto (Japan)
借用HDU1284这道题的方法,可以做这道题目
#include <stdio.h>#include <string.h>#include <algorithm>#include <queue>using namespace std;int sum[500],coin[20];int main(){ int n; for(int i=1; i<=17; i++) coin[i]=i*i; memset(sum,0,sizeof sum); sum[0]=1; for(int i=1; i<=17; i++) for(int j=coin[i]; j<=300; j++) sum[j]+=sum[j-coin[i]]; while(scanf("%d",&n)&&n) printf("%d\n",sum[n]); return 0;}
0 0
- hdu1398-Square Coins
- hdu1398 Square Coins
- HDU1398-Square Coins
- hdu1398 -Square Coins
- hdu1398 Square Coins(组合)
- HDU1398-Square Coins
- hdu1398 Square Coins
- hdu1398 Square Coins
- Square Coins (hdu1398)
- Square Coins(HDU1398)
- hdu1398 Square Coins(生成函数)
- hdu1398 Square Coins 母函数
- 【母函数】hdu1398(Square Coins)
- HDU1398 Square Coins【母函数】
- 【HDU1398】Square Coins 母函数
- hdu1398 Square Coins 母函数水题
- HDU1398 Square Coins 【母函数模板】
- HDU1398 Square Coins(母函数)
- EventBus简单使用
- 图片无限轮播
- Code Review:代码审查工具大阅兵
- linux同步机制
- XML
- HDU1398-Square Coins
- [bzoj4664] Count 解题报告
- 腾讯在线笔试感受
- 学习日记20160906
- Linux-C预习内容(二)
- nyoj16矩形嵌套
- python安装和版本选择
- [LeetCode] 150. Evaluate Reverse Polish Notation
- QGroundControl笔记 —— 串口数据流