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.
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.
有4中面值的硬币,每种面值的硬币的数量给出,求出使用最多的硬币的数量且价值最大
硬币的价值为(1,5,10,25)
思路:
理解题意可以按多重背包理解,如果在完全背包的基础上增加一个记录数据变化的数组和一个记录使用次数的数组,就可以理解为完全背包;
所以按完全背包的思路做:
代码:
#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<string>
#include<cmath>
#include<string.h>
using namespace std;
const int MAX=200;
int bag,dp[MAX],path[MAX];
int num[50],used[MAX];
int coin[50]={0,1,5,10,25};
int main()
{
while(cin>>bag>>num[1]>>num[2]>>num[3]>>num[4],bag+num[1]+num[2]+num[3]+num[4])
{
memset(dp,0,sizeof(dp));
memset(path,0,sizeof(path));
dp[0]=1;path[0]=-1;
for(int i=1;i<=4;i++)
{
memset(used,0,sizeof(used));
for(int j=coin[i];j<=bag;j++)
if(dp[j-coin[i]]+1>dp[j]&&dp[j-coin[i]]&&used[j-coin[i]]+1<=num[i])//硬币的面值看做重量,每个硬币的价值都为1;
{
dp[j]=dp[j-coin[i]]+1;//dp中保存最大价值,也可以理解为可以组成该背包的解的个数
used[j]=used[j-coin[i]]+1;//该种面值的硬币使用的次数
path[j]=j-coin[i];//记录背包的装载过程中的量
}
}
cout<<dp[bag]<<endl;
if(dp[bag]!=0)
{
memset(num,0,sizeof(num));
while(path[bag]!=-1)//直到背包容量为0
{
num[bag-path[bag]]++;//递归的寻找下个装入量
bag=path[bag];
}
printf("Throw in %d cents, %d nickels, %d dimes, and %d quarters.\n",num[1],num[5],num[10],num[25]);
}
else
printf("Charlie cannot buy coffee.\n");
}
}