HDU 1398-Square Coins(简单母函数)
来源:互联网 发布:淘宝怎么设置起拍数量 编辑:程序博客网 时间:2024/05/29 16:28
Square Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12575 Accepted Submission(s): 8631
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 <stdio.h>#define maxn 305int c1[maxn];int c2[maxn];int main(){for(int i=0; i<maxn; i++){c1[i] = 1;c2[i] = 0;}for(int i=2; i<=17; i++){for(int j=0; j<maxn; j++)for(int k=0; k+j<maxn; k+=i*i){c2[j+k] += c1[j];}for(int j=0; j<maxn; j++){c1[j] = c2[j];c2[j] = 0;}}int n;while(scanf("%d", &n), n){printf("%d\n", c1[n]);}return 0;}
阅读全文
0 0
- HDU 1398-Square Coins(简单母函数)
- hdu 1398 Square Coins(母函数,DP)
- HDU/HDOJ 1398 Square Coins 母函数
- hdu 1398 Square Coins (母函数)
- hdu 1398 Square Coins (母函数)
- hdu 1398 Square Coins(母函数)
- hdu 1398 Square Coins(母函数)
- [母函数]HDU 1398 Square Coins
- Hdu 1398 Square Coins 母函数
- hdu-1398 Square Coins(母函数)
- HDU 1398 Square Coins(母函数)
- hdu 1398 Square Coins (母函数)
- HDU 1398 Square Coins 母函数
- HDU -- 1398 Square Coins(母函数)
- hdu 1398 Square Coins (母函数)
- HDU 1398-Square Coins (母函数)
- hdu 1398 Square Coins(母函数)
- hdu 1398 Square Coins(母函数)
- tensorflow和python学习中遇到的问题
- 类的__str__()和__repr()__方法
- Ubuntu16.04安装卸载Kinetic
- SPOJ GSS1 [线段树]
- shell 中的日期date格式化
- HDU 1398-Square Coins(简单母函数)
- /*Oracle修改表结构*/
- 2、计算字符个数
- Python 2.7.x 和 3.x 版本的重要区别小结
- Codeforces 337D Book of Evil【树形Dp】好题~好题~
- ssh 本地转发 和远程转发 区别
- __repr__定义一个类的特定返回形式
- UDP和多线程服务器
- Marriage is Stable (稳定婚姻匹配GS算法)