poj 1787 Charlie's Change (多重背包可作完全背包)
2016-01-31 15:26
316 查看
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
Sample Output
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 3792 | Accepted: 1144 |
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四种硬币,给定每种硬币的数量,给定要组合成的价值,问刚好达到价值时用的硬币最多的情况。 附上代码:
#include <iostream> #include <cstdio> #include <cstring> #define N 10010 #define inf (-0x3f3f3f3f) using namespace std; int max(int a,int b) { return a>b?a:b; } int main() { int dp ,path ,used ; // dp[j] 表示 j 块钱最多由多少块硬币组成, //path[j] 表示 上一次最多有多少块构成的 j 块钱,used[j] 表示 j 块钱时,已经放了多少同种类的硬币。 int i,j,m,n; int num[4],val[4]= {1,5,10,25}; 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; 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]; } } } int ans[100]; memset(ans,0,sizeof(ans)); if(dp <0) { printf("Charlie cannot buy coffee.\n"); } else { while(path !=-1) { ans[n-path ]++; n=path ; } 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; }
相关文章推荐
- JVM-垃圾收集器
- nginx、apach、php、mysql编译参数
- 重构——七层登录
- hdu 4291 A Short problem(矩阵+取模循环节)
- coco2d-js在HTML上可以运行,但是打包apk后会黑屏
- Java程序员使用的20几个大数据工具
- 【校内互测】生日礼物
- bzoj3668 起床困难综合症
- Java程序员使用的20几个大数据工具
- Eclipse打开Package Explorer
- 关于iwpriv :no private ioctls 的问题
- 最短路径floyd算法
- Android之LayoutParams的用法
- 【完美解决】android开发 自定义字体安装包过大的问题
- projecteuler---->problem=9----Special Pythagorean triplet
- 成为优秀程序员的十条黄金法则
- poj1733 Parity game(并查集)
- 成为优秀程序员的十条黄金法则
- ubuntu忘记密码 修改密码报错 Authentication token manipulation error解决
- poj3641