hdoj1398
来源:互联网 发布:linux重启后dracut 编辑:程序博客网 时间:2024/06/02 18:19
Square Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10134 Accepted Submission(s): 6932
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 Output
1427
Sample Output
1427
#include<stdio.h>int c2[301];//暂时数据 int c1[301];int main(){ int N; while(scanf("%d",&N)!=EOF&&N) { for(int i=0;i<=N;i++)//第一个表达式 { c1[i]=1; c2[i]=0; } for(int i=2;i<=17;i++) { for(int j=0;j<=N;j++)//第二个表达式与第一个乘起来 { for(int k=0;k+j<=N;k+=i*i) { c2[k+j]+=c1[j]; } } for(int i=0;i<=N;i++)//第一个第二个表达式相乘后归并成第一个表达式 { c1[i]=c2[i]; c2[i]=0; } } printf("%d\n",c1[N]); } return 0;}
0 0
- hdoj1398
- hdoj1398
- hdoj1398 Square Coins
- HDOJ1398 Square Coins
- HDOJ1398 母函数题目
- AddBigDigital
- 自定义View
- oc函数调用
- oracle数据库性能优化 - 降低IO
- shell实例浅谈之一判断是可执行文件并存在PATH路径中
- hdoj1398
- Spring大致流程梳理【未完结】
- Codeforces 709B Checkpoints ( 模拟)
- 关于ubuntu16.04 ubuntu14.04 安装MySQL的远程访问的问题
- Shader Forge 基础使用方法
- ps进程命令
- Leap Motion 的原理
- 遇见的bug
- adb 常用命令的使用