Buy the souvenirs - HDU 2126 背包dp
2014-07-27 12:32
471 查看
Buy the souvenirs
Time Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 915 Accepted Submission(s): 311
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.
题意:买最多数量的物品有多少种买法。
思路:dp[i][j]表示买i种物品花j元钱的情况是否存在。
AC代码如下:
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; int dp[31][510],n,m; void solve() { int i,j,k; for(i=n;i>=1;i--) { k=0; for(j=m;j>=0;j--) k+=dp[i][j]; if(k>0) { printf("You have %d selection(s) to buy with %d kind(s) of souvenirs.\n",k,i); return; } } printf("Sorry, you can't buy anything.\n"); } int main() { int t,i,j,k,p; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); memset(dp,0,sizeof(dp)); dp[0][0]=1; for(i=1;i<=n;i++) { scanf("%d",&p); for(j=m;j>=p;j--) for(k=i;k>=1;k--) if(dp[k-1][j-p]>0) dp[k][j]+=dp[k-1][j-p]; } solve(); } }
相关文章推荐
- HDU 2126 Buy the souvenirs(DP:01背包)
- HDU2126——背包DP(开状态)——Buy the souvenirs
- hdu 2126 Buy the souvenirs 二维01背包方案总数
- hdu 2126 Buy the souvenirs(二维0/1背包)
- HDU 2126 (背包方法数) Buy the souvenirs
- hdu 2126 Buy the souvenirs(求方案数的背包)
- HDU-2126 Buy the souvenirs (DP)
- HDU 2126 Buy the souvenirs (dp 二维01背包)
- hdu 2126 Buy the souvenirs (01背包输出方案数)
- HDU 2126 Buy the souvenirs (贪心&0-1背包最优解的个数)
- 01背包变形 之 hdu 2126 Buy the souvenirs
- hdu 2126 Buy the souvenirs(求方案数的背包)
- hdu 2126 Buy the souvenirs(01背包求最大容量方法数)
- hdu 2126 Buy the souvenirs 买纪念品(01背包,略变形)
- hdu 2126 Buy the souvenirs(求方案数的背包)
- HDU 2126 Buy the souvenirs (01背包)
- HDU 2126 Buy the souvenirs
- hdu2126——Buy the souvenirs——————【01背包记录物品最多时种数】
- HDU 2126 Buy the souvenirs 01背包 输出方案数
- hdu 2126 Buy the souvenirs