zoukankan      html  css  js  c++  java
  • hdu 2126 Buy the souvenirs 二维01背包方案总数

    Buy the souvenirs

    Time Limit: 10000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)


    Problem Description
    When the winter holiday comes, a lot of people will have a trip. Generally, there are a lot of souvenirs to sell, and sometimes the travelers will buy some ones with pleasure. Not only can they give the souvenirs to their friends and families as gifts, but also can the souvenirs leave them good recollections. All in all, the prices of souvenirs are not very dear, and the souvenirs are also very lovable and interesting. But the money the people have is under the control. They can’t buy a lot, but only a few. So after they admire all the souvenirs, they decide to buy some ones, and they have many combinations to select, but there are no two ones with the same kind in any combination. Now there is a blank written by the names and prices of the souvenirs, as a top coder all around the world, you should calculate how many selections you have, and any selection owns the most kinds of different souvenirs. For instance:



    And you have only 7 RMB, this time you can select any combination with 3 kinds of souvenirs at most, so the selections of 3 kinds of souvenirs are ABC (6), ABD (7). But if you have 8 RMB, the selections with the most kinds of souvenirs are ABC (6), ABD (7), ACD (8), and if you have 10 RMB, there is only one selection with the most kinds of souvenirs to you: ABCD (10).
     
    Input
    For the first line, there is a T means the number cases, then T cases follow.
    In each case, in the first line there are two integer n and m, n is the number of the souvenirs and m is the money you have. The second line contains n integers; each integer describes a kind of souvenir.
    All the numbers and results are in the range of 32-signed integer, and 0<=m<=500, 0<n<=30, t<=500, and the prices are all positive integers. There is a blank line between two cases.
     
    Output
    If you can buy some souvenirs, you should print the result with the same formation as “You have S selection(s) to buy with K kind(s) of souvenirs”, where the K means the most kinds of souvenirs you can buy, and S means the numbers of the combinations you can buy with the K kinds of souvenirs combination. But sometimes you can buy nothing, so you must print the result “Sorry, you can't buy anything.”
     
    Sample Input
    2 4 7 1 2 3 4 4 0 1 2 3 4
     
    Sample Output
    You have 2 selection(s) to buy with 3 kind(s) of souvenirs. Sorry, you can't buy anything.
     
    Author
    wangye
     
    Source

      思路:在01背包的方案dp方程再加一维,记录K;

        dp[i][t]+=dp[i-a[j]][t-1];

    #include<bits/stdc++.h>
    using namespace std;
    #define ll long long
    #define esp 0.00000000001
    const int N=1e3+10,M=1e6+10,inf=1e9+10,mod=1000000007;
    int a[N];
    int dp[N][N];
    int main()
    {
        int x,y,z,i,t;
        int T;
        scanf("%d",&T);
        while(T--)
        {
            memset(dp,0,sizeof(dp));
            scanf("%d%d",&x,&y);
            for(i=1;i<=x;i++)
            scanf("%d",&a[i]);
            dp[0][0]=1;
            for(i=1;i<=x;i++)
            {
                for(t=y;t>=a[i];t--)
                {
                    for(int j=0;j<x;j++)
                    dp[t][j+1]+=dp[t-a[i]][j];
                }
            }
            int ans=0;
            for(t=x;t>=0;t--)
            {
                ans=0;
                for(i=0;i<=y;i++)
                ans+=dp[i][t];
                if(ans>0)break;
            }
            if(t>0)
            printf("You have %d selection(s) to buy with %d kind(s) of souvenirs.
    ",ans,t);
            else
            printf("Sorry, you can't buy anything.
    ");
        }
        return 0;
    }
  • 相关阅读:
    Oracle 19c RAC自动应用RU补丁过程
    Git忽略删除已加入和未加入版本控制的文件
    樊启斌高等代数典型问题与方法思考与练习答案已完成第3章43题累计128页
    樊启斌高等代数典型问题与方法思考与练习答案已完成第2章行列式41题累计85页
    樊启斌高等代数典型问题与方法思考与练习答案已完成第1章多项式71题
    樊启斌思考与练习参考解答1.02厦门大学2012,哈尔滨工业大学2009
    河北工业大学2000-2019年数学分析考研试题
    青岛大学2009-2017年数学分析高等代数考研试题
    樊启斌思考与练习参考解答1.01北京大学2008
    南京航空航天大学2017年第04届数学竞赛非数学专业试题及参考解答
  • 原文地址:https://www.cnblogs.com/jhz033/p/5710554.html
Copyright © 2011-2022 走看看