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): 5564    Accepted Submission(s): 2297


    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
     
    #include<stdio.h>
    #include<string.h>
    #define N 100005
    int dp[N],w[N],num[N],val[N];
    int main()
    {
        int i,j,k,n,m;
        while(~scanf("%d %d",&n,&m),n||m)
        {
            for(i=0;i<n;i++)
            scanf("%d",&w[i]);
            for(i=0;i<n;i++)
                scanf("%d",&num[i]);
                k=0;
            for(i=0;i<n;i++)
            {
                j=1;
                while(j<=num[i])
                {
                    num[i]-=j;
                    val[k++]=j*w[i];
                    j*=2;
                }
                if(num[i])
                    val[k++]=num[i]*w[i];
            }
            memset(dp,0,sizeof(dp));
            dp[0]=1;
            for(i=0;i<k;i++)
                for(j=m;j>=val[i];j--)
                if(dp[j-val[i]])
                dp[j]=1;
            int ans=0;
            for(i=1;i<=m;i++)
                if(dp[i]) ans++;
            printf("%d
    ",ans);
    
        }
        return 0;
    }
  • 相关阅读:
    java web使用WebSocket
    solr的使用
    mybatis中模糊查询的实现方式
    Java反射的简单使用
    TCP/IP协议 资料整理
    Java单向链表的实现
    Spring boot使用JWT来做接口登录验证
    sql性能优化
    前端实践项目(四)使用koa搭建开发环境
    前端实践项目 目录
  • 原文地址:https://www.cnblogs.com/llei1573/p/3440677.html
Copyright © 2011-2022 走看看