zoukankan      html  css  js  c++  java
  • hdu 2844 Coins

    Coins
    
    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 4893    Accepted Submission(s): 2001
    
    
    Problem Description
    Whuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in a nearby shop. He wanted to pay the exact price(without change) and he known the price would not more than m.But he didn't know the exact price of the watch.
    
    You are to write a program which reads n,m,A1,A2,A3...An and C1,C2,C3...Cn corresponding to the number of Tony's coins of value A1,A2,A3...An then calculate how many prices(form 1 to m) Tony can pay use these coins.
     
    
    Input
    The input contains several test cases. The first line of each test case contains two integers n(1 ≤ n ≤ 100),m(m ≤ 100000).The second line contains 2n integers, denoting A1,A2,A3...An,C1,C2,C3...Cn (1 ≤ Ai ≤ 100000,1 ≤ Ci ≤ 1000). The last test case is followed by two zeros.
     
    
    Output
    For each test case output the answer on a single line.
     
    
    Sample Input
    3 10
    1 2 4 2 1 1
    2 5
    1 4 2 1
    0 0
     
    
    Sample Output
    8
    4
     
    
    Source
    2009 Multi-University Training Contest 3 - Host by WHU



    // 多重背包 二进制优化
    #include <iostream>
    #include <algorithm>
    #include <queue>
    #include <math.h>
    #include <stdio.h>
    #include <string.h>
    using namespace std;
    int M[100010];
    int main()
    {
        int A[110],C[110];
        int n,m;
        int i,j,k;
        while(scanf("%d %d",&n,&m),n|m){
           for(i=1;i<=n;i++)
              scanf("%d",&A[i]);
           for(i=1;i<=n;i++)
              scanf("%d",&C[i]);
           M[0]=1;
           for(i=1;i<=m;i++)
              M[i]=0;
           int temp;
           for(i=1;i<=n;i++){
                k=1;
              while(k<=C[i]){
                C[i]-=k;
                temp=k*A[i];
                for(j=m;j>=temp;j--)
                    if(M[j-temp])
                       M[j]=1;
                k=k<<1;
              }
              if(C[i]>0) {k=C[i];
                temp=k*A[i];
                for(j=m;j>=temp;j--)
                    if(M[j-temp])
                       M[j]=1;
              }
           }
          k=0;
          for(i=1;i<=m;i++)
            if(M[i])k++;
          printf("%d
    ",k);
        }
        return 0;
    }
  • 相关阅读:
    enum 与 enum class
    git error: unable to rewind rpc post data
    ip地址转换
    大端字节序&小端字节序(网络字节序&主机字节序)
    c++虚析构函数
    引用
    单例模式
    c++ 类静态成员、非静态成员初始化
    算法导论进度帖startedby20131029
    Linux驱动程序接口
  • 原文地址:https://www.cnblogs.com/372465774y/p/3179312.html
Copyright © 2011-2022 走看看