Cash Machine
来源:互联网 发布:python自动化测试工具 编辑:程序博客网 时间:2024/06/06 00:09
Cash Machine
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)
Total Submission(s) : 8 Accepted Submission(s) : 5
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
Source
PKU
简单的多重背包,不多说了。
代码如下:
#include <iostream>#include <cstdio>using namespace std;int dist[105000];int value[15];int acount[15];int n , m ;void ZeroOnePack(int v){ for(int i = m; i>= v; i --) { dist[i] = max(dist[i] , dist[i-v]+v); }}void CompletePack(int v){ for(int i = v; i <= m; i ++) { dist[i] = max(dist[i] , dist[i-v]+v); }}void MultiPack(int v , int amount){ if(v * amount >= m) { CompletePack(v); } else { int k = 1; int cnt = amount; while(k <= cnt) { ZeroOnePack(k*v); cnt -= k ; k *= 2; } if(cnt) ZeroOnePack(cnt*v); }}int main(){ while(scanf("%d%d",&m,&n)!=EOF) { if(n == 0){ printf("0\n"); continue; } for(int i = 0; i < n; i ++) { scanf("%d %d",&acount[i],&value[i]); } for(int i = 0; i <= m; i ++) { dist[i] = 0; } for(int i = 0; i < n; i ++) { MultiPack(value[i] , acount[i]); } printf("%d\n",dist[m]); } return 0;}
0 0
- Cash Machine
- Cash Machine
- Cash Machine
- Cash Machine
- Cash Machine
- poj1276 Cash Machine
- pku 1276 Cash Machine
- pku1276 Cash Machine (DP)
- PKU Cash Machine
- pku 1276 Cash Machine
- poj 1276 Cash Machine
- poj1276 Cash Machine
- poj 1276 Cash Machine
- poj 1276Cash Machine
- poj1276 cash machine
- POJ 1276 Cash Machine
- poj1276 - Cash Machine
- poj 1276 Cash machine
- 冲突域广播域
- Ubuntu下使用虚拟机安装Windows XP
- MVC和三层架构的区别
- Java项目打war包的方法
- 安装完Oracle 11g之后启动SQL Developer 时报cannot find a j2se sdk错误的解决办法
- Cash Machine
- 成员函数指针以及C++委托
- Android基础系列----------- Application的作用
- linux 查看端口是否被占用
- eclipse中安装tomcat插件重启后工具栏不显示tomcat图标问题以及tomcat中加载工程的配置
- ArcGIS支持实时地理信息系统
- oracle存储过程中的if...elseif...else用法
- servlet过滤器Filter入门(转,有自己的例子)
- solr的安装和配置