hdu 1398 Square Coins 分钱币问题
2016-07-27 21:58
148 查看
Square Coins
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit Status Practice HDU 1398
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
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit Status Practice HDU 1398
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 dp[i]=dp[i-mon[i]]+dp[i]
相关文章推荐
- poj1220
- 无限轮播
- Optional优雅的使用null
- 10010---centos关机与重启命令详解
- 嵌入式开发15天(标准IO,交叉编译,模块化编程)
- SCAU_专题训练2&3
- windows下搭建基于ssh的git服务器
- wait和waitpid函数总结
- BD___PV操作
- 增加线程异步发送消息的方法一(Thread)
- Leetcode题集——rotate image
- Android 热修复三部曲之基本的Ant打包脚本
- 输入数字n,按顺序打印出1到最大的n位十进制数。比如输入3,则打印出1、2、3一直到最大的3位数即999。
- inotify+rsync安装配置
- 使用Jsoup 抓取页面的数据
- centos之lnmp
- 数据之美——读书笔记2
- SpringMVC-json
- hdu 2768 Cat vs. Dog(最大独立集)
- 阅读笔记 - TextProposals