Square Coins
来源:互联网 发布:淘宝 国际米兰球衣 编辑:程序博客网 时间:2024/04/30 15:50
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>#include<string.h>int a[400],b[400];int main(){int n,i,j,k;while(~scanf("%d",&n)) { if(n==0) break; memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); for(i=0;i<=n;i++) { a[i]=1;b[i]=0; } for(i=2;i<=n;i++) { for(j=0;j<=n;j++) for(k=0;k+j<=n;k+=i*i) b[k+j]+=a[j]; for(int i=0;i<=n;i++) { a[i]=b[i];b[i]=0; } } printf("%d\n",a[n]); }return 0;}
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
- MySQL事务处理
- 网易新闻
- Windows下通过Telnet连接Linux主机
- 压缩感知中的lp球:p范数最优化为什么总会导致一个稀疏的解的原因
- JAVA中获取时间的两种方法
- Square Coins
- 生成设备对象
- 数据结构之二叉排序树
- String to Integer(atoi)
- 2-11. 两个有序链表序列的合并(15)
- Objective- C 编程 Block
- 数据结构之平衡二叉树
- 《数据结构》实验二:线性表的实验
- 九度OJ 1043 蔡勒公式