zoukankan      html  css  js  c++  java
  • poj1742 多重背包的可行性问题

    http://poj.org/problem?

    id=1742

    Description

    People in Silverland use coins.They have coins of value A1,A2,A3...An Silverland dollar.One day Tony opened his money-box 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
    /**
    poj 1742  多重背包的可行性问题
    题目大意:给定n种面值的硬币面值分别为wi个数为ci。问用这些硬币能够组成1~m之间的多少面值
    解题思路:楼教主的男人八题之中的一个。算是一个经典的问题,定义一个sum数组。每次填dp[j]时直接由dp[j-weight[i]]推出。
              前提是sum[j-w[i]]<c[i].sum每填一行都要清零。sum[j]表示当前物品填充j大小的包须要至少使用多少个.复杂度O(n*m)
    */
    #include <stdio.h>
    #include <string.h>
    #include <iostream>
    #include <iostream>
    using namespace std;
    
    int n,m;
    int w[105],c[105],sum[100005],dp[100005];
    
    int main()
    {
        while(~scanf("%d%d",&n,&m))
        {
            if(n==0&&m==0)break;
            for(int i=0;i<n;i++)
            {
                scanf("%d",&w[i]);
            }
            for(int i=0;i<n;i++)
            {
                scanf("%d",&c[i]);
            }
            memset(dp,0,sizeof(dp));
            dp[0]=1;
            int ans=0;
            for(int i=0;i<n;i++)
            {
                memset(sum,0,sizeof(sum));
                for(int j=w[i];j<=m;j++)
                {
                    if(!dp[j]&&dp[j-w[i]]&&sum[j-w[i]]<c[i])
                    {
                        dp[j]=1;
                        sum[j]=sum[j-w[i]]+1;
                        ans++;
                    }
                }
            }
            printf("%d
    ",ans);
        }
        return 0;
    }
    


  • 相关阅读:
    Dynamics 365 多租户?多实例?
    接口接收gzip压缩数据并解压
    系统检测到在一个调用中尝试使用指针参数时的无效指针地址 问题
    PBI DAX 中GroupBy
    将sql 查询结果导出到excel
    自动生成数据库表分区脚本
    快速生成导入亿级测试数据到sqlserver
    powershell 版本问题
    运行powershell 脚本 在此系统上禁止运行脚本
    python网站收集
  • 原文地址:https://www.cnblogs.com/lcchuguo/p/5176706.html
Copyright © 2011-2022 走看看