【POJ】1787 Charlie's Change（完全背包）

Charlie's Change

Description

Charlie is a driver of Advanced Cargo Movement, Ltd. Charlie drives a lot and so he often buys coffee at coffee vending machines at motorests. Charlie hates change. That is basically the setup of your next task. 

Your program will be given numbers and types of coins Charlie has and the coffee price. The coffee vending machines accept coins of values 1, 5, 10, and 25 cents. The program should output which coins Charlie has to use paying the coffee so that he uses as many coins as possible. Because Charlie really does not want any change back he wants to pay the price exactly. 

Input

Each line of the input contains five integer numbers separated by a single space describing one situation to solve. The first integer on the line P, 1 <= P <= 10 000, is the coffee price in cents. Next four integers, C1, C2, C3, C4, 0 <= Ci <= 10 000, are the numbers of cents, nickels (5 cents), dimes (10 cents), and quarters (25 cents) in Charlie's valet. The last line of the input contains five zeros and no output should be generated for it.

Output

For each situation, your program should output one line containing the string "Throw in T1 cents, T2 nickels, T3 dimes, and T4 quarters.", where T1, T2, T3, T4 are the numbers of coins of appropriate values Charlie should use to pay the coffee while using as many coins as possible. In the case Charlie does not possess enough change to pay the price of the coffee exactly, your program should output "Charlie cannot buy coffee.".

Sample Input

 
 

  
  12 5 3 1 2
 
 
16 0 0 0 1

 
 
0 0 0 0 0

Sample Output

 
 

  
  Throw in 2 cents, 2 nickels, 0 dimes, and 0 quarters.
 
 
 
 

  
  Charlie cannot buy coffee.
 
 

题目大意：分硬币，有1，5，10，25四种硬币，给定每种硬币的数量，给定要组合成的价值，问刚好达到价值时用的硬币最多的情况。

感觉上是多重背包，实际上用完全背包的思路来做很快！dp[j] 表示 j 块钱最多由多少块硬币组成， path[j] 表示 上一次最多有多少块构成的 j 块钱， used[j] 表示 j 块钱时，已经放了多少同种类的硬币。

#include <iostream>
using namespace std;
#include <stdio.h>
#include <string.h>

#define	inf	(-0x3f3f3f3f)
const int maxn = 10010;
#define max(a,b)	((a)>(b)?(a):(b))

int dp[maxn], path[maxn], used[maxn];

int main()
{
	int num[4], val[4] = {1, 5, 10, 25};
	int n;
	while (scanf("%d %d %d %d %d", &n, &num[0], &num[1], &num[2], &num[3]))
	{
		if(n==0&&num[0]==0&&num[1]==0&&num[2]==0&&num[3]==0)break;
		memset(dp, inf, sizeof(dp));
		memset(path, 0, sizeof(path));
		path[0] = -1;
		dp[0] = 0;

		int i, j;
		for (i=0; i<4; i++)
		{
			memset(used, 0, sizeof(used));
			for (j=val[i]; j<=n; j++)
			{
				if (dp[j-val[i]] + 1 > dp[j] && dp[j-val[i]] >= 0 && used[j-val[i]] < num[i])
				{
					dp[j] = dp[j-val[i]] + 1;
					used[j] = used[j-val[i]] + 1;
					path[j] = j - val[i];
				}
			}
		}
/*
		for (j=0; j<=n; j++)
			printf("%d\t%d\n", j, path[j]);
		puts("");
*/
		int ans[100];
		memset(ans, 0, sizeof(ans));
		if (dp[n] < 0)
		{
			puts("Charlie cannot buy coffee.");
		}
		else
		{
			while (path[n] != -1)
			{
				ans[n-path[n]] ++;
				n = path[n];
			}
			printf("Throw in %d cents, %d nickels, %d dimes, and %d quarters.\n", ans[val[0]], ans[val[1]], ans[val[2]], ans[val[3]]);
		}
	}
	return 0;
}

—————————————————————————————————

本文原创自Slience的csdn技术博客。

本博客所有原创文章请以链接形式注明出处。

欢迎关注本技术博客，本博客的文章会不定期更新。

大多数人想要改造这个世界，但却罕有人想改造自己。

世上没有绝望的处境，只有对处境绝望的人。

                                              ————By slience

—————————————————————————————————