hdu2126---Buy the souvenirs(01背包方案数)
来源:互联网 发布:windows loader v3.27 编辑:程序博客网 时间:2024/04/19 00:08
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
/************************************************************************* > File Name: hdu2126.cpp > Author: ALex > Mail: zchao1995@gmail.com > Created Time: 2015年03月05日 星期四 21时04分58秒 ************************************************************************/#include <map>#include <set>#include <queue>#include <stack>#include <vector>#include <cmath>#include <cstdio>#include <cstdlib>#include <cstring>#include <iostream>#include <algorithm>using namespace std;const double pi = acos(-1);const int inf = 0x3f3f3f3f;const double eps = 1e-15;typedef long long LL;typedef pair <int, int> PLL;int dp[510];int dp2[510];int goods[35];int main (){ int t; int n, m; scanf("%d", &t); while (t--) { scanf("%d%d", &n, &m); int all = 0; for (int i = 1; i <= n; ++i) { scanf("%d", &goods[i]); } int tmp = m; sort (goods + 1, goods + 1 + n); for (int i = 1; i <= n; ++i) { if (tmp >= goods[i]) { ++all; tmp -= goods[i]; } else { break; } } if (!all) { printf("Sorry, you can't buy anything.\n"); continue; } memset (dp, 0, sizeof (dp)); for (int i = 0; i <= m; ++i) { dp2[i] = 1; } for (int i = 1; i <= n; ++i) { for (int j = m; j >= goods[i]; --j) { if (dp[j] < dp[j - goods[i]] + 1) { dp[j] = dp[j - goods[i]] + 1; dp2[j] = dp2[j - goods[i]]; } else if (dp[j] == dp[j - goods[i]] + 1) { dp2[j] += dp2[j - goods[i]]; } } } printf("You have %d selection(s) to buy with %d kind(s) of souvenirs.\n", dp2[m], all); } return 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(求方案数的背包)
- 杂七杂八 - 进制转换
- MFC:如何判断非模态对话框已经创建了
- Android 2.x版本使用ActionBar-强制显示OverflowButton
- 《Xcode基本用法》如何运行C/C++/Object-C程序
- strstr的非KMP实现方法
- hdu2126---Buy the souvenirs(01背包方案数)
- hdu1202
- LoadRunner教程08:HTML和URL比较
- leetcode-53 Maximum Subarray
- 关于 PCRE_UTF8 support 问题
- 习大大重要讲话概要
- 试用zip构造字典
- 关于Java中内存结构
- MySQL新建用户,授权,删除用户,修改密码,远程登陆,亲测可行