HDU 1398 Square Coin(简单完全背包)
来源:互联网 发布:苹果mac是什么意思 编辑:程序博客网 时间:2024/06/05 17:20
Square Coins
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 27 Accepted Submission(s) : 16
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;
int dp[10001];
int v;
int val[3];
int coin[20];
const int inf=0x7FFFFFFF;
int main()
{
while(cin>>v,v)
{
for(int i=1;i<=17;i++)
{
coin[i]=i*i;
}
memset(dp,0,sizeof(dp));
dp[0]=1;
for(int i=1;i<=17;i++)
for(int j=coin[i];j<=v;j++)
{
dp[j]+=dp[j-coin[i]];
}
cout<<dp[v]<<endl;
}
return 0;
}
#include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;
int dp[10001];
int v;
int val[3];
int coin[20];
const int inf=0x7FFFFFFF;
int main()
{
while(cin>>v,v)
{
for(int i=1;i<=17;i++)
{
coin[i]=i*i;
}
memset(dp,0,sizeof(dp));
dp[0]=1;
for(int i=1;i<=17;i++)
for(int j=coin[i];j<=v;j++)
{
dp[j]+=dp[j-coin[i]];
}
cout<<dp[v]<<endl;
}
return 0;
}
0 0
- HDU 1398 Square Coin(简单完全背包)
- hdu 1398 Square Coins 完全背包变形
- HDU 1398 Square coins 完全背包
- HDU-1398-Square Coins(完全背包)
- hdu 1398 Square Coins(简单背包)
- hdu 1398 Square Coins(母函数|完全背包)
- hdu 1398 Square Coins(母函数,完全背包)
- hdu 1398 Square Coins(母函数/完全背包)
- hdu 1398 Square Coins 母函数+完全背包
- uva 674 && hdu 2069 coin change(水完全背包)
- hdu 1587 简单完全背包
- hdu 1398 Square Coins(完全背包变形---求方案总数)
- hdu 1398完全背包
- hdu 2189(简单完全背包)
- Uva 674 Coin Change 完全背包
- uva 674Coin Change(完全背包)
- uva 674 Coin Change(完全背包)
- UVaOJ-674 Coin Change (完全背包)
- 华为OJ——密码强度等级
- C++ STL算法系列4---unique , unique_copy函数
- 88. Merge Sorted Array
- Spring学习笔记2
- 华为OJ——扑克牌大小
- HDU 1398 Square Coin(简单完全背包)
- Android开发之app崩溃日志收集以及上传
- "虹软杯" 中国大学生程序设计竞赛 (杭州赛区)-网络赛水题题解
- 华为OJ——合法IP
- HDU 1248 寒冰王座(简单完全背包)
- 设计模式之禅——六大设计原则之接口隔离原则
- Matlab BP神经网络使用方法
- C++ STL算法系列3---求和:accumulate
- hadoop的伪分布模式配置