POJ-1276-Cash Machine(多重背包)
2015-12-20 22:21
357 查看
Cash Machine
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 30568 Accepted: 11018
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.
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.
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 350
633 4 500 30 6 100 1 5 0 1
735 0
0 3 10 100 10 50 10 10
Sample Output
735
630
0
0
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.
标准的多重背包,没有什么变化,水题
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 30568 Accepted: 11018
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.
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.
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 350
633 4 500 30 6 100 1 5 0 1
735 0
0 3 10 100 10 50 10 10
Sample Output
735
630
0
0
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.
标准的多重背包,没有什么变化,水题
#include <iostream> #include <string.h> #include <math.h> #include <algorithm> #include <stdlib.h> using namespace std; #define MAX 1000 int n,m; int a[MAX+5]; int b[MAX+5]; int dp[MAX*100]; void ZeroOnePack(int v,int w) { for(int i=n;i>=w;i--) dp[i]=max(dp[i],dp[i-w]+v); } void CompletePack(int v,int w) { for(int i=w;i<=n;i++) dp[i]=max(dp[i],dp[i-w]+v); } void MultiplyPack(int v,int w,int c) { if(c*w>=n) { CompletePack(v,w); return; } int k=1; while(k<c) { ZeroOnePack(v*k,w*k); c-=k; k<<=1; } ZeroOnePack(c*v,c*w); } int main() { while(scanf("%d%d",&n,&m)!=EOF) { memset(dp,0,sizeof(dp)); for(int i=0;i<m;i++) scanf("%d%d",&a[i],&b[i]); for(int i=0;i<m;i++) MultiplyPack(b[i],b[i],a[i]); printf("%d\n",dp ); } }
相关文章推荐
- 树莓派研发笔记三——搭建服务器和实践任务
- 4.未公开的Oracle数据库秘密笔记——参数说明——OS_AUTHENT_PREFIX
- select的内核实现原理
- 排序算法2之冒泡排序
- linux进程间通信-----管道总结实例
- 3.未公开的Oracle数据库秘密笔记——参数说明——EVENT
- HashTable和HashMap
- online_judge_1121
- ucosIII 事件标志组、同时等待多个内核对象、存储管理
- UITableView---总结
- ylbtech-Unitity-CS-Arrays:数组
- 软工实践总结
- Android屏幕适配
- Android system
- 2.未公开的Oracle数据库秘密笔记——参数说明——PGA_AGGREGATE_TARGET
- 第3章 UI
- 使用java递归实现文件及文件夹的复制
- POJ-1322 Chocolate(概率DP)
- VIM私人配置
- POJ-1322 Chocolate(概率DP)