hdu 1398(普通型母函数)
来源:互联网 发布:大麦户源码 编辑:程序博客网 时间:2024/04/28 11:52
Square Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4675 Accepted Submission(s): 3166
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)
Recommend
Ignatius.L
题目类型:普通型母函数
题目描述:略
题目分析:裸
代码如下:
#include <stdio.h>#include <memory.h>#define N 301int r[N];int t[N];void init(){ int i,j,k; for( i = 0; i < N; i++){ r[i] = 1; t[i] = 0; } for( k = 2; k <= 17; k++){ for( i = 0; i < N; i++){ for( j = 0; j < N; j += k*k) { if( r[i] != 0 && i + j < N){ t[i+j] += r[i]; } } } for( i = 0; i < N ; i++){ r[i] = t[i]; t[i] = 0; } }}int main(){ int x; init(); while(scanf("%d",&x),x){ printf("%d\n",r[x]); } return 0;}
- hdu 1398(普通型母函数)
- hdu 1028(普通型母函数)
- hdu 1085(普通型母函数)
- hdu 1171(普通型母函数)
- hdu 1709(普通型母函数)
- 普通型母函数模板
- [ACM] hdu 2079 选课时间(普通型母函数)
- hdu 2082--找单词 普通型母函数的应用
- 2017-10-22 HDU 2082 普通型母函数
- 普通型母函数模板理解
- 母函数——普通型母函数
- B.找单词——(HDU 2082 普通型母函数)
- 普通型母函数详解及其模板类型
- HDOJ1028(正整数拆分-普通型母函数模板)
- hdu1284钱币兑换问题 (普通型母函数)
- 普通型母函数原理及模板代码详解
- 生成函数入门-普通型生成函数
- 普通型母函数学习小记 Hdu1028 + Hdu1085 Holding Bin-Laden Captive! +Hdu2082
- 【读书笔记】代码大全
- c++程序员需熟练应用的开源项目
- 数据库知识总结
- libevent源码深度剖析一
- 全屏
- hdu 1398(普通型母函数)
- libevent库源码学习-evport(Event ports)(Solaris 10)
- java例程练习(泛型和自动打包、解包)
- 获取手机屏幕的高度和宽度
- Namebanch测试结果DNS
- 研究生生活
- 人生的路很远,一路小心
- Hadoop的前世今生(2)——ipc的Client(1)
- 生活要找准自己努力的方向