L - Dollars 完全背包

最新推荐文章于 2026-05-24 16:04:03 发布

原创最新推荐文章于 2026-05-24 16:04:03 发布 · 312 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

算法专栏收录该内容

145 篇文章

订阅专栏

本文详细解析了如何使用完全背包算法解决新西兰货币组合问题，通过给出的代码示例，展示了如何计算任意金额下可能的货币组合数量。文章强调了正确处理浮点数到整数转换的重要性，并提供了一个完整的C++实现。

L - Dollars UVA - 147

Dollars

New Zealand currency consists of $100, $50, $20, $10, and $5 notes and $2, $1, 50c, 20c, 10c and 5c coins. Write a program that will determine, for any given amount, in how many ways that amount may be made up. Changing the order of listing does not increase the count. Thus 20c may be made up in 4 ways: 1 tex2html_wrap_inline25 20c, 2 tex2html_wrap_inline25 10c, 10c+2 tex2html_wrap_inline25 5c, and 4 tex2html_wrap_inline25 5c.

Input

Input will consist of a series of real numbers no greater than $300.00 each on a separate line. Each amount will be valid, that is will be a multiple of 5c. The file will be terminated by a line containing zero (0.00).

Output

Output will consist of a line for each of the amounts in the input, each line consisting of the amount of money (with two decimal places and right justified in a field of width 6), followed by the number of ways in which that amount may be made up, right justified in a field of width 17.

Sample input

0.20
2.00
0.00

Sample output

0.20 4
2.00 293

题意：一共11种硬币，然后给你一个硬币数，问有多少种组成方法。且输出有空格要求。

分析：各种硬币数无限，所以是完全背包。先把输入的m转换为整数n，n=( int ) (m*100.0+0.5)，注意double转换为int时要四舍五入。dp[i]表示组成i分的硬币有多少种方法。

代码：

#include<iostream>
#include<cstdio>
#include<string.h>
using namespace std;
typedef long long ll;
const int N=30005;
int n,w[11]={5,10,20,50,100,200,500,1000,2000,5000,10000};
ll dp[N];
int main()
{
	double m;
	dp[0]=1;
	for(int i=0;i<11;i++)
	{
		for(int j=w[i];j<N;j++)
			dp[j]+=dp[j-w[i]];
	}
	while(~scanf("%lf",&m))
	{
		if(m==0.00)
			break;
		n=(int)(m*100.0+0.5);
		printf("%6.2lf%17lld\n",m,dp[n]);
	}
	return 0;
}