poj 1276 Cash Machine(多重背包+倍增)
来源:互联网 发布:淘宝金融服务 编辑:程序博客网 时间:2024/04/28 08:49
Cash Machine
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17441 Accepted: 6038
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
题目:http://poj.org/problem?id=1276
分析:这题就是多重背包+倍增优化的模板题了,没什么好讲的
代码:
#include<cstdio>using namespace std;const int mm=111111;const int mn=1111;int d[mn],s[mn];int n,m;bool f[mm];void CompletePack(int v){ for(int i=v;i<=m;++i)f[i]|=f[i-v];}void ZeroOnePack(int v){ for(int i=m;i>=v;--i)f[i]|=f[i-v];}int main(){ int i,j; while(scanf("%d%d",&m,&n)!=-1) { for(i=0;i<n;++i)scanf("%d%d",&s[i],&d[i]); for(i=f[0]=1;i<=m;++i)f[i]=0; for(i=0;i<n;++i) if(s[i]) if(s[i]*d[i]>=m)CompletePack(d[i]); else { j=1; while(j<s[i]) { ZeroOnePack(d[i]*j); s[i]-=j; j<<=1; } ZeroOnePack(d[i]*s[i]); } while(!f[m])--m; printf("%d\n",m); } return 0;}
- 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 1276 Cash Machine
- 【POJ】1276 Cash Machine(多重背包)
- 【DP|多重背包】POJ-1276 Cash Machine
- poj 1276 Cash Machine(多重背包)
- POJ 1276 Cash Machine【多重背包DP】
- poj 1276 Cash Machine (多重背包)
- POJ 1276 Cash Machine(多重背包)
- poj 1276 Cash Machine(多重背包)
- poj 1276 Cash Machine (多重背包)
- poj 1276 Cash Machine (多重背包)
- 数论题目分类
- sigsetjmp, siglongjmp函数说明
- ACM数学(转)
- 函数指针终极练习
- 我居然在 CSDN 开过博客?天,都忘记了。
- poj 1276 Cash Machine(多重背包+倍增)
- 更新屏幕值得函数
- 盖房子
- 分析QQ和QQ游戏的价值特性极其快速发展的原因,并对其盈利模式进行探讨
- 三种数据库的分页语句
- 队列操作
- itat的预赛
- playbin2的内部实现框图
- 理解 Ruby Symbol