POJ 1276 Cash Machine
来源:互联网 发布:网络打印机经常脱机 编辑:程序博客网 时间:2024/06/05 23:42
Cash Machine
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33348 Accepted: 12084
Description
A Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominations, say Dk, k=1,N, and for each denomination Dk the machine has a supply of nk bills. For example,
N=3, n1=10, D1=100, n2=4, D2=50, n3=5, D3=10
means the machine has a supply of 10 bills of @100 each, 4 bills of @50 each, and 5 bills of @10 each.
Call cash the requested amount of cash the machine should deliver and write a program that computes the maximum amount of cash less than or equal to cash that can be effectively delivered according to the available bill supply of the machine.
Notes:
@ is the symbol of the currency delivered by the machine. For instance, @ may stand for dollar, euro, pound etc.
N=3, n1=10, D1=100, n2=4, D2=50, n3=5, D3=10
means the machine has a supply of 10 bills of @100 each, 4 bills of @50 each, and 5 bills of @10 each.
Call cash the requested amount of cash the machine should deliver and write a program that computes the maximum amount of cash less than or equal to cash that can be effectively delivered according to the available bill supply of the machine.
Notes:
@ is the symbol of the currency delivered by the machine. For instance, @ may stand for dollar, euro, pound etc.
Input
The program input is from standard input. Each data set in the input stands for a particular transaction and has the format:
cash N n1 D1 n2 D2 ... nN DN
where 0 <= cash <= 100000 is the amount of cash requested, 0 <=N <= 10 is the number of bill denominations and 0 <= nk <= 1000 is the number of available bills for the Dk denomination, 1 <= Dk <= 1000, k=1,N. White spaces can occur freely between the numbers in the input. The input data are correct.
cash N n1 D1 n2 D2 ... nN DN
where 0 <= cash <= 100000 is the amount of cash requested, 0 <=N <= 10 is the number of bill denominations and 0 <= nk <= 1000 is the number of available bills for the Dk denomination, 1 <= Dk <= 1000, k=1,N. White spaces can occur freely between the numbers in the input. The input data are correct.
Output
For each set of data the program prints the result to the standard output on a separate line as shown in the examples below.
Sample Input
735 3 4 125 6 5 3 350633 4 500 30 6 100 1 5 0 1735 00 3 10 100 10 50 10 10
Sample Output
73563000
Hint
The first data set designates a transaction where the amount of cash requested is @735. The machine contains 3 bill denominations: 4 bills of @125, 6 bills of @5, and 3 bills of @350. The machine can deliver the exact amount of requested cash.
In the second case the bill supply of the machine does not fit the exact amount of cash requested. The maximum cash that can be delivered is @630. Notice that there can be several possibilities to combine the bills in the machine for matching the delivered cash.
In the third case the machine is empty and no cash is delivered. In the fourth case the amount of cash requested is @0 and, therefore, the machine delivers no cash.
In the second case the bill supply of the machine does not fit the exact amount of cash requested. The maximum cash that can be delivered is @630. Notice that there can be several possibilities to combine the bills in the machine for matching the delivered cash.
In the third case the machine is empty and no cash is delivered. In the fourth case the amount of cash requested is @0 and, therefore, the machine delivers no cash.
Source
Southeastern Europe 2002
题解:这个题考的是背包, 题目意思是给一个总现金数K和n组数据,每一组是数量和价值,求小于K的最大价值总和;代码是将多重背包转换为0-1背包,用到2次方压缩的方法
将数量和价值优化了;然后用0-1背包的方法做就可以了。
题解:这个题考的是背包, 题目意思是给一个总现金数K和n组数据,每一组是数量和价值,求小于K的最大价值总和;代码是将多重背包转换为0-1背包,用到2次方压缩的方法
将数量和价值优化了;然后用0-1背包的方法做就可以了。
#include <iostream>#include <stdio.h>#include <string.h>using namespace std;int dp[100050];int vnum[1050];int k;int max(int a, int b){ return a>b?a:b;}void solve(int m){ int i, j; for(i=1; i<=k; i++) { for(j=m; j>=vnum[i]; j--) { dp[j]=max(dp[j], dp[j-vnum[i]]+vnum[i]); } } cout<<dp[m]<<endl;}int main(){ int v, w, n, m, i, j; while(~scanf("%d",&m)) { scanf("%d",&n); k=0; for(i=0; i<n; i++) { scanf("%d %d",&v, &w); for(j=1; j<=v; j*=2)//使得1, 2, 4, 8...包含所有可能的价值 { vnum[++k]=w*j; v-=j; } if(v>0) vnum[++k]=v*w; } solve(m); memset(dp,0,sizeof(dp)); memset(vnum,0,sizeof(vnum)); } return 0;}
0 0
- poj 1276 Cash Machine
- poj 1276 Cash Machine
- poj 1276Cash Machine
- POJ 1276 Cash Machine
- poj 1276 Cash machine
- poj 1276 Cash Machine
- poj 1276 Cash Machine
- POJ 1276 Cash Machine
- POJ 1276 Cash Machine
- POJ 1276 Cash Machine
- poj 1276 Cash Machine
- POJ-1276Cash Machine
- POJ 1276 cash machine
- POJ 1276 Cash Machine
- POJ 1276 Cash Machine
- POJ 1276 Cash Machine
- POJ 1276 Cash Machine
- POJ-1276-Cash Machine
- memcache数据缓存
- 王学岗RxJava(一)
- J-Chip Factory(2015ACM-ICPC长春站)
- [数据结构]查找(二)
- LeetCode 100. Same Tree 题解
- POJ 1276 Cash Machine
- 尝试将I/O流 用一张图来表示
- windbg设断点命令详解(bp, bu, bm, ba 以及bl, bc, bd, be)
- 关于ORB_SLAM2在Ubuntu16.04下编译出错的解决办法之一
- Android学习之 VideoView,SurfaceView 资源
- 2016年3月最新苹果上线流程
- 最大流最小割——hihoCoder 1378
- Android报错:调用so库时“xxx.so has text relocations”
- sql 注入方式