E - The Values You Can Make
2018-06-17 23:43:51来源:未知 阅读 ()
E - The Values You Can Make
Description
Pari wants to buy an expensive chocolate from Arya. She has n coins, the value of the i-th coin is ci. The price of the chocolate is k, so Pari will take a subset of her coins with sum equal to k and give it to Arya.
Looking at her coins, a question came to her mind: after giving the coins to Arya, what values does Arya can make with them? She is jealous and she doesn't want Arya to make a lot of values. So she wants to know all the values x, such that Arya will be able to make x using some subset of coins with the sum k.
Formally, Pari wants to know the values x such that there exists a subset of coins with the sum k such that some subset of this subset has the sum x, i.e. there is exists some way to pay for the chocolate, such that Arya will be able to make the sum x using these coins.
Input
The first line contains two integers n and k (1 ≤ n, k ≤ 500) — the number of coins and the price of the chocolate, respectively.
Next line will contain n integers c1, c2, ..., cn (1 ≤ ci ≤ 500) — the values of Pari's coins.
It's guaranteed that one can make value k using these coins.
Output
First line of the output must contain a single integer q— the number of suitable values x. Then print q integers in ascending order — the values that Arya can make for some subset of coins of Pari that pays for the chocolate.
Sample Input
6 18
5 6 1 10 12 2
16
0 1 2 3 5 6 7 8 10 11 12 13 15 16 17 18
3 50
25 25 50
3
0 25 50
题目大意:给n个数和和一个k,求下列n个数的子集中和为k的子集,然后将这些子集各自里的数相加得出的这些数输出,第一行输出个数,第二行从小到大输出。
详解:http://blog.csdn.net/apm__5/article/details/51804533
代码:
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
bool d[501][501][501];
vector<int> v;
int main()
{ int n,k,a;
while(cin>>n>>k)
{ d[0][0][0]=1;
v.clear();
for(int i=1;i<=n;i++)
{
scanf("%d",&a);
for(int j=0;j<=500;j++)
for(int q=0;q<=k&&q<=j;q++)
{
if((d[i-1][j][q])||(j>=a&&d[i-1][j-a][q])||(q>=a&&d[i-1][j-a][q-a]))
d[i][j][q]=1;
}
}
for(int i=0;i<=k;i++)
if(d[n][k][i])
v.push_back(i);
int l=v.size();
cout<<l<<endl;
for(int i=0;i<l;i++)
printf("%d ",v[i]);
cout<<endl;
}
}
标签:
版权申明:本站文章部分自网络,如有侵权,请联系:west999com@outlook.com
特别注意:本站所有转载文章言论不代表本站观点,本站所提供的摄影照片,插画,设计作品,如需使用,请与原作者联系,版权归原作者所有
- SGU 132 Another Chocolate Maniac 2020-03-06
- 协程的原理(Coroutine Theory) 2020-02-23
- 二叉堆(2)LeftistHeap 2020-02-19
- Boost C++ 库 中文教程(全) 2019-12-19
- Run-Time Check Failure #0 - The value of ESP was not pro 2019-11-11
IDC资讯: 主机资讯 注册资讯 托管资讯 vps资讯 网站建设
网站运营: 建站经验 策划盈利 搜索优化 网站推广 免费资源
网络编程: Asp.Net编程 Asp编程 Php编程 Xml编程 Access Mssql Mysql 其它
服务器技术: Web服务器 Ftp服务器 Mail服务器 Dns服务器 安全防护
软件技巧: 其它软件 Word Excel Powerpoint Ghost Vista QQ空间 QQ FlashGet 迅雷
网页制作: FrontPages Dreamweaver Javascript css photoshop fireworks Flash