poj 1276 Cash Machine
来源:互联网 发布:美工做图用什么电脑 编辑:程序博客网 时间:2024/06/05 11:44
Cash Machine
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)
Total Submission(s) : 16 Accepted Submission(s) : 9
Problem 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
多重背包问题,套用模版就可以ac的
但是要注意估算数组的规模,保证下表不越代码如下
#include<iostream>#include <cstdio>#include <string>#include <cstring>using namespace std;const int maxn=1000100,INF=-100000;int a[1005],b[1005];int f[maxn],n,m;void olbag(int v){ for(int i=m;i>=v;i--) f[i]=max(f[i],f[i-v]+v);}void completbag(int v){ for(int i=v;i<=m;i++) f[i]=max(f[i],f[i-v]+v);}void choose(int v,int s){ if(v*s>=m) completbag(v); else { int k=1; int cnt=s; while(k<=cnt) { olbag(k*v); cnt-=k; k*=2; } olbag(cnt*v); }}int main(){ while(scanf("%d",&m)!=EOF) { scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d %d",&b[i],&a[i]); } if(n==0||m==0)//这个操作要放在数据读入完成之后否则会出错的 { printf("0\n"); continue; } for(int i=0;i<=m;i++) f[i]=0; for(int i=1;i<=n;i++) choose(a[i],b[i]); printf("%d\n",f[m]); } 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
- STL 之 queue、priority_queue 源码剖析
- 用JS有效解决移动web浏览器中HTML元素的overflow:scroll滚动属性失效问题
- emacs run multiple eshell buffers (more then one eshell)
- jpeg和pjpeg问题
- ios 出现CopyPngFile error解决方法
- poj 1276 Cash Machine
- DSP C6000汇编,数据字节非对齐问题的处理
- 11【项目2 - 职员有薪水了】
- 产品经理进阶沙盘演练
- 二叉树的深度和广度搜索算法
- 苹果审核指南
- XFire实现身份验证(基于Xfire SOAP Header的WebService安全验证)
- 爬虫程序
- 生产环境使用elasticsearch遇到的一些问题以及解决方法