Square Coins
来源:互联网 发布:anywhere软件 编辑:程序博客网 时间:2024/05/16 07:41
Square Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9019 Accepted Submission(s): 6160
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<cstdio>#include<iostream>#include<cmath>using namespace std;int main(){ int i,j,k,flag,n,a[315],b[315]; while(cin>>n&&n) { for(i=0;i<=n;i++) { a[i]=1; b[i]=0; } for(i=2;i*i<=n&&i<=17;i++) { for(j=0;j<=n;j++) { for(k=0;k+j<=n;k+=i*i) { b[j+k]+=a[j]; } } for(j=0;j<=n;j++) { a[j]=b[j]; b[j]=0; } } printf("%d\n",a[n]); }}
0 0
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- Square Coins
- hdu 1398Square Coins
- 1398 Square Coins
- zoj 1666 Square Coins
- HDOJ Square Coins
- hdu 1398 Square Coins
- Hdu 1398 - Square Coins
- Big Event in HDU
- 米2s 进入recovery模式
- 第六周项目3-人数不定的工资类
- hiho一(第四十一周)------骨牌覆盖问题·一
- 第六周 项目3-人数不定的工资类
- Square Coins
- 看数据结构写代码(45) 拓扑排序
- ubuntu14.04中利用samba访问linux/windows共享目录的方法
- ollydbg设置断点总结
- android推送实时视频流到darwin流媒体服务器的思路
- 解决 pathForResource 返回 nil的问题
- 第六周项目4(1)-成员函数、友元函数和一般函数の区别
- thrift远程调用示例
- Cocos2D-X 项目发布到Android平台(一)Windows 上搭建Android ADT 开发环境