POJ 1787(完全背包+记录路径)
2015-09-06 21:33
381 查看
POJ - 1787
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
Source
CTU Open 2003
题意:有1分,5分,10分,25分四种面值的硬币,问怎样组合成一个整数P,要求硬币的数量越多越好。
思路:完全背包 + 记录路径
AC代码:
Charlie's Change
Time Limit: 1000MS | Memory Limit: 30000KB | 64bit IO Format: %I64d & %I64u |
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.
Source
CTU Open 2003
题意:有1分,5分,10分,25分四种面值的硬币,问怎样组合成一个整数P,要求硬币的数量越多越好。
思路:完全背包 + 记录路径
AC代码:
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; #define inf 0x7fffffff int p; int a[5], dp[10010],used[10010],path[10010],ans[26]; int v[5]; int main() { while(scanf("%d%d%d%d%d", &p, &a[1], &a[2], &a[3], &a[4]) != EOF) { if(p+a[1]+a[2]+a[3]+a[4] == 0) break; for(int i = 0;i <= p;i ++) dp[i] = -inf; dp[0] = 0; memset(path, -1, sizeof(path)); v[1] = 1; v[2] = 5; v[3] = 10; v[4] = 25; for(int i = 1;i <= 4;i ++) { memset(used, 0, sizeof(used)); for(int j = v[i];j <= p;j ++) { if(dp[j-v[i]]+1 > dp[j] && used[j-v[i]] < a[i] && dp[j-v[i]] >= 0) { dp[j] = dp[j-v[i]]+1; used[j] = used[j - v[i]]+1; path[j] = j - v[i]; } } } if(dp[p] == -inf) printf("Charlie cannot buy coffee.\n"); else { int i = p; memset(ans, 0, sizeof(ans)); while(1) { if(path[i] == -1) break; ans[i-path[i]]++; i = path[i]; } printf("Throw in %d cents, %d nickels, %d dimes, and %d quarters.\n",ans[1],ans[5],ans[10],ans[25]); } } return 0; }
相关文章推荐
- 简单的四则运算
- 数的奇偶性
- ACM网址
- 1272 小希的迷宫
- 1272 小希的迷宫
- hdu 1250 大数相加并用数组储存
- 矩阵的乘法操作
- 蚂蚁爬行问题
- 蚂蚁爬行问题
- 求两个数的最大公约数【ACM基础题】
- 打印出二进制中所有1的位置
- 杭电题目---一只小蜜蜂
- HDOJ 1002 A + B Problem II (Big Numbers Addition)
- POJ ACM 1001
- POJ ACM 1002
- POJ 2635 The Embarrassed Cryptographe
- POJ 3292 Semi-prime H-numbers
- ACM题库以及培养策略
- 排序算法之快速排序
- 网易2018校招题