POJ1276 Cash Machine 【解法一】
来源:互联网 发布:国家药品食品数据查询 编辑:程序博客网 时间:2024/06/05 00:20
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.
解法二见【这里】。
二进制优化多重背包。
#include<cstdio>#include<cstring>#include<cmath>bool dp[100010];int vv[100010],v[15],num[15];int main(){ int i,j,k,m,n,p,q,x,y,z; while (scanf("%d%d",&k,&n)==2) { memset(dp,0,sizeof(dp)); for (i=1;i<=n;i++) scanf("%d%d",&num[i],&v[i]); m=0; for (i=1;i<=n;i++) { for (x=1;x<=num[i];x<<=1) { vv[++m]=x*v[i]; num[i]-=x; } if (num[i]) vv[++m]=num[i]*v[i]; } dp[0]=1; for (i=1;i<=m;i++) for (j=k;j>=vv[i];j--) dp[j]|=dp[j-vv[i]]; for (i=k;;i--) if (dp[i]) { printf("%d\n",i); break; } }}
- POJ1276 Cash Machine 【解法一】
- POJ1276 Cash Machine 【解法二】
- poj1276 Cash Machine
- poj1276 Cash Machine
- poj1276 cash machine
- poj1276 - Cash Machine
- poj1276 Cash Machine
- POJ1276-Cash Machine .
- POJ1276 Cash Machine
- POJ1276 Cash Machine
- Cash Machine poj1276
- POJ1276 cash machine
- POJ1276 Cash Machine
- POJ1276-Cash Machine
- [背包]poj1276 Cash Machine
- poj1276(Cash Machine + 多重背包)
- POJ1276:Cash Machine(多重背包)
- POJ1276:Cash Machine(多重背包)
- Java循环语句之 while · doWhile · for · 多重循环
- Leetcode题解 141. Linked List Cycle
- JDBC
- TreeView(竖节点控件)《笔记4》
- C语言指针的函数运用和数组
- POJ1276 Cash Machine 【解法一】
- ajax、xml、json
- android studio NDK 配置及入门案例
- 处理浏览器的兼容问题之nextSibling
- Leetcode题解 142. Linked List Cycle II
- git修改启动目录和改变项目位置
- hdu5723 最小生成树+DFS(距离和,期望)
- python核心编程学习笔记-2016-07-19-03-局部变量代替模块变量
- MySQL读书笔记-MVCC多版本并发控制