zoukankan      html  css  js  c++  java
  • poj 1276 -- Cash Machine

    Cash Machine
     
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 27649   Accepted: 9845

    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.

    题目链接:Cash Machine
    思路:多重背包转换成01背包去做。。。
     
     1 /*======================================================================
     2  *           Author :   kevin
     3  *         Filename :   CashMachine.cpp
     4  *       Creat time :   2014-09-11 20:54
     5  *      Description :
     6 ========================================================================*/
     7 #include <iostream>
     8 #include <algorithm>
     9 #include <cstdio>
    10 #include <cstring>
    11 #include <queue>
    12 #include <cmath>
    13 #define clr(a,b) memset(a,b,sizeof(a))
    14 #define M 20000
    15 using namespace std;
    16 int cash,n,num[15],h[15],w[M];
    17 int dp[100005];
    18 int main(int argc,char *argv[])
    19 {
    20     while(scanf("%d%d",&cash,&n) != EOF){
    21         clr(w,0);
    22         clr(h,0);
    23         clr(dp,0);
    24         clr(num,0);
    25         for(int i = 0; i < n; i++){
    26             scanf("%d%d",&num[i],&h[i]);
    27         }
    28         int cnt = 0;
    29         for(int i = 0; i < n; i++){
    30             int cc = num[i];
    31             for(int k = 1; k <= cc; k <<= 1){
    32                 w[cnt++] = k*h[i];
    33                 cc -= k;
    34             }
    35             if(cc > 0){
    36                 w[cnt++] = cc*h[i];
    37             }
    38         }
    39         for(int i = 0; i < cnt; i++){
    40             for(int j = cash; j >= w[i]; j--){
    41                 dp[j] = max(dp[j],dp[j-w[i]]+w[i]);
    42             }
    43         }
    44         printf("%d
    ",dp[cash]);
    45     }
    46     return 0;
    47 }
    View Code
     
  • 相关阅读:
    WordPress研究心得
    Java之生成Pdf并对Pdf内容操作
    Java之生成条形码、PDF、HTML
    Redis口令设置
    Redis启动问题解决方案
    网狐6603手机棋牌游戏源码.rar
    LNK1179 无效或损坏的文件: 重复的 COMDAT“_IID_IDispatchEx”
    c++转C#
    error LNK1281: 无法生成 SAFESEH 映像 LNK2026 模块对于 SAFESEH 映像是不安全的 VS2015 /win10
    当两行的数据一样时,要删除一行的正则表达式解决办法。
  • 原文地址:https://www.cnblogs.com/ubuntu-kevin/p/3972313.html
Copyright © 2011-2022 走看看