HDOJ Square Coins
来源:互联网 发布:linux mint 18界面美化 编辑:程序博客网 时间:2024/05/17 08:43
Square Coins
http://acm.hdu.edu.cn/showproblem.php?pid=1398
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3774 Accepted Submission(s): 2590
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
这里的增量是i*i.
构造母函数: f(x)=(1+x+x^2+x^3+…)(1+x^4+x^4+x^12+…)(1+x^9+x^18+x^27+…)……
#include<iostream>
using namespace std;
int main(){
int n;
int c[301],temp[301];
while(scanf("%d",&n),n){
for(int i=0;i<=n;i++){
c[i]=1;
temp[i]=0;
}
for(int i=2;i<=17;i++){ //对每个表达式进行处理
for(int j=0;j<=n;j++)
for(int k=0;j+k<=n;k+=i*i ) //增量是i*i
temp[j+k]+=c[j];
for(int j=0;j<=n;j++){
c[j]=temp[j];
temp[j]=0;
}
}
printf("%d\n",c[n]);
}
return 0;
}
using namespace std;
int main(){
int n;
int c[301],temp[301];
while(scanf("%d",&n),n){
for(int i=0;i<=n;i++){
c[i]=1;
temp[i]=0;
}
for(int i=2;i<=17;i++){ //对每个表达式进行处理
for(int j=0;j<=n;j++)
for(int k=0;j+k<=n;k+=i*i ) //增量是i*i
temp[j+k]+=c[j];
for(int j=0;j<=n;j++){
c[j]=temp[j];
temp[j]=0;
}
}
printf("%d\n",c[n]);
}
return 0;
}
- HDOJ Square Coins
- hdoj 1398 Square Coins
- hdoj 1398 Square Coins
- HDOJ 1398 Square Coins
- HDOJ 1398 Square Coins
- hdoj-1398-Square Coins
- HDOJ 1398 Square Coins解题报告
- HDU/HDOJ 1398 Square Coins 母函数
- hdoj 1398 Square Coins(母函数)
- 母函数之Square Coins hdoj 1398
- HDOJ-1398-Square Coins 解题报告
- HDOJ Square Coins 1398【母函数】
- hdoj--1398--Square Coins(母函数)
- hdoj 1398 Square Coins【母函数】
- HDOJ-1398 Square Coins(母函数)
- HDOJ--1398Square Coins!!母函数
- Square Coins
- Square Coins
- 星期五。。。。
- SecrecySMS Pro Version 2.6 released the important updating
- android spinner 总结
- 正则表达式(二)
- C++中的声明和定义的区别
- HDOJ Square Coins
- 我dotNET 所以我绚丽 (WinForm控件小选)
- 常见MFC UI界面库
- Java异常处理的陋习展播
- 数据库的连接
- bom
- 下拉菜单案例
- LaTeX/基础知识
- 精辟的话C++ VS JAVA