E - The Values You Can Make
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; }
}
最新文章
- float 和 inline-block的心得
- 工作流模式与K2实现- (1)
- sql server where、group by、order by 执行顺序
- xampp下安装yii框架下遇到的问题
- Codeforces 628E Zbazi in Zeydabad 树状数组
- [King.yue]Grid列赋值文本,隐藏Value
- mybatis防止sql注入
- 数据提交成功后如何避免alert被window.location.reload()影响
- 与JavaWeb有关的故事(web请求与Java I/O)
- Python 实现auto linlink 连连看
- 什么是事务?事务特性?事务隔离级别?spring事务传播特性?
- linux目录文件及系统启动知识
- What&#39;s New In Zeebe: Scaling Zeebe, New Client APIs, Faster Requests, Timestamps, NodeJS Client, and Default Topic is Back!
- django的i18n是如何实现的
- 在c语言中嵌入汇编语句,对于我来说相当难。
- np.linspace
- php 向二维数组中追加元素
- IOS 使用XIB 自定义View
- Spring学习笔记--初始化和销毁Bean
- docker启动容器关于防火墙报错