【01背包方案数】HDU2126-Buy the souvenirs
来源:互联网 发布:java ll 和 编辑:程序博客网 时间:2024/03/29 21:11
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2126
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).
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.
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
24 71 2 3 44 01 2 3 4
Sample Output
You have 2 selection(s) to buy with 3 kind(s) of souvenirs.Sorry, you can't buy anything.
01背包代码:
#include<iostream>#include<cstring>using namespace std;const int maxn=505;const int maxm=35;int dp[maxn][maxm]={0}; // dp[i][j]表示花i钱可以买j个物品的方案数;int a[maxm]={0};int n,m;void ZeroOnePack(){ memset(dp,0,sizeof(dp)); dp[0][0]=1; int maxnum=0; for(int i=0;i<n;i++){ // 物品枚举; for(int j=m;j>=a[i];j--){ // 总金额枚举; for(int k=i+1;k>=0;k--){ // 最多购买k件物品; if(dp[j-a[i]][k-1]){ // 如果少一件物品的价格减少a[i]的方案存在,那么更新dp[j][k]方案; dp[j][k]+=dp[j-a[i]][k-1]; maxnum=max(maxnum,k); // 保存最大件数; } } } } int ans=0; for(int i=0;i<=m;i++) ans+=dp[i][maxnum]; if(maxnum) cout<<"You have "<<ans<<" selection(s) to buy with "<<maxnum<<" kind(s) of souvenirs."<<endl; else cout<<"Sorry, you can't buy anything."<<endl;}int main(){ int t; cin.sync_with_stdio(false); cin>>t; while(t--){ cin>>n>>m; for(int i=0;i<n;i++) cin>>a[i]; ZeroOnePack(); } return 0;}/* 题目意思: 给你n件物品,m元钱,以及每件物品对应的价格; 问你最多可以购买多少件,购买最多件数的方案有多少种;*/
0 0
- hdu2126---Buy the souvenirs(01背包方案数)
- 【01背包方案数】HDU2126-Buy the souvenirs
- hdu2126 Buy the souvenirs (01)
- HDU2126:Buy the souvenirs(01)
- hdu2126 Buy the souvenirs 01背包变形 dp
- hdu2126 Buy the souvenirs(01背包变化)
- hdu2126 Buy the souvenirs(01背包+路径)
- HDU2126:Buy the souvenirs(类01背包)
- HDU2126:Buy the souvenirs
- hdu2126 Buy the souvenirs
- 【HDU2126】【Buy the souvenirs】
- HDU 2126 Buy the souvenirs 01背包 输出方案数
- Buy the souvenirs(方案数+01背包)
- hdu 2126 Buy the souvenirs (01背包输出方案数)
- HDU-2126 Buy the souvenirs (记录最优方案数的01背包问题 入门题)
- NYOJ 2126 Buy souvenirs(01背包+输出方案数)
- hdu2126——Buy the souvenirs——————【01背包记录物品最多时种数】
- hdu 2126 Buy the souvenirs(求方案数的背包)
- android可执行文件出现error: only position independent executables (PIE) are supported.
- JS中style、currentStyle、getComputedStyle的区别
- <mvc:annotation-driven/>的作用
- 开发小技巧:1.iOS初始化系统主题
- Anti-Debugging Skills In APK
- 【01背包方案数】HDU2126-Buy the souvenirs
- HDU 5832——A water problem & 2016CCPC网络赛1001
- MongoDB学习笔记-安装部署和简易API操作
- OpenPLC--可编程控制器的发展趋势
- 【USACO题库】1.3.1 Mixing Milk混合牛奶
- 线程与进程的区别
- SQLi Labs Lesson18
- 2569. 【NOIP2011模拟9.17】旅行 (StandardIO)Description
- java之annotation与框架的那些秘密