Buy the souvenirsTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3228 Accepted Submission(s): 1247 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.
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 HDU 2007-10 Programming Contest
Recommend 威士忌 | We have carefully selected several similar problems for you: 2128 2129 2130 2125 2124
|
题意:给出n个物品的价值,并且每个物品只能买一次,求m元最多买到的物品的数量和当前数量的种类。
思路:dp[i][j][k]表示有k元的时候在前i种商品中最多购买j种商品的方案数,那么就分为第i种商品买或者不买,买的话就是dp[i][j][k]=dp[i][j][k]+dp[i-1][j-1][k-a[i]],不买的话就是dp[i][j][k]=dp[i][j][k]+dp[i-1][j][k],递推即可。
#include<bits/stdc++.h>
using namespace std;
int dp[35][35][505],n,m,a[35];//dp[i][j][k]表示有k元的时候,在前i个物品中买j种商品
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
memset(dp,0,sizeof(dp));
for(int i=0;i<=n;i++)
for(int j=0;j<=m;j++)
dp[i][0][j]=1;
for(int i=1;i<=n;i++)
for(int j=1;j<=i;j++)
for(int k=m;k>=0;k--)
{
if(k>=a[i])
dp[i][j][k]+=dp[i-1][j-1][k-a[i]];
dp[i][j][k]+=dp[i-1][j][k];
}
int flag=0;
for(int i=n;i>=1;i--)
{
if(dp[n][i][m]!=0)
{
flag=1;
printf("You have %d selection(s) to buy with %d kind(s) of souvenirs.\n",dp[n][i][m],i);
break;
}
}
if(!flag)
printf("Sorry, you can't buy anything.\n");
}
return 0;
}