hdu 1398
来源:互联网 发布:矩阵qr分解 given 编辑:程序博客网 时间:2024/06/05 02:21
Square Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4018 Accepted Submission(s): 2735
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
(1)#include<iostream>
using namespace std;
int s[20],f[305];
int main()
{
int i , j , n;
for( i = 0; i < 17; i++ )
{
s[i]=(i+1)*(i+1);
}
f[0]=1;
for( i = 0; i < 17; i++ )
{
for( j = s[i]; j < 305; j++)
{
f[j]+=f[j-s[i]];
}
}
while( cin>>n, n )
{
cout<<f[n]<<endl;
}
return 0;
}母函数转化完全背包
(2母函数解法)#include<iostream>
using namespace std;
int s[20],f[305];
int main()
{
int i , j , n;
for( i = 0; i < 17; i++ )
{
s[i]=(i+1)*(i+1);
}
f[0]=1;
for( i = 0; i < 17; i++ )
{
for( j = s[i]; j < 305; j++)
{
f[j]+=f[j-s[i]];
}
}
while( cin>>n, n )
{
cout<<f[n]<<endl;
}
return 0;
}
- hdu 1398
- HDU 1398
- HDU 1398
- hdu 1398
- HDU 1398
- hdu 1398
- hdu 1398
- hdu 1398
- HDU 1398
- hdu 1398
- HDU 1398
- 母函数初级运用 hdu 1028 、hdu 1398、hdu 1085
- hdu 1398 hdoj 1398
- hdu 1398Square Coins
- 母函数 hdu 1398
- hdu 1398 Square Coins
- Hdu 1398 - Square Coins
- hdu 1398 Square Coins
- 【毕业生】资历与跳槽
- SQL 约束
- 基于移动平台的多媒体框架——用VLC搭建简单的流媒体服务器
- 第二章、字符串是否包含及相关问题扩展
- 开通博客
- hdu 1398
- Windows Azure 之 Storage Blob 常见操作
- windows xp系统的IIS系统asp.net网站部署
- 第八章、从头至尾漫谈虚函数
- ASP.NET自定义错误页面
- 我的FC15声卡好像出问题了
- NMF
- C语言学习笔记(八)--数组
- SQL数据库字段类型图解