题意：问你凑出K的所有子集C之和
思路：令dp[i][j][k]为用第i个凑出j的子集之和为k是否可行
然后dp[i][j][k]|=dp[i-1][j][k],dp[i][j][k]|=dp[i-1][j-c][k],dp[i][j][k]|=dp[i-1][j-c][k-c]直接搞就好了
注意：会爆内存，改用bool或者滚动数组就好了
#include<bits\stdc++.h>
using namespace std;
int dp[505][505][505];
vector<int>ans;
int main()
{
int n,k;
scanf("%d%d",&n,&k);
dp[0][0][0]=1;
for(int i = 1;i<=n;i++)
{
int c;
scanf("%d",&c);
for(int j = 0;j<=500;j++)
for(int k = 0;k<=j;k++)
{
dp[i][j][k]|=dp[i-1][j][k];
if(j>=c)
dp[i][j][k]|=dp[i-1][j-c][k];
if(k>=c && j>=c)
dp[i][j][k]|=dp[i-1][j-c][k-c];
}
}
for(int i = 0;i<=500;i++)
if(dp[n][k][i])
ans.push_back(i);
cout << ans.size() << endl;
for(int i = 0;i<ans.size();i++)
cout << ans[i] << " ";
cout << endl;
}
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 xusing 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.
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.
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.
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 5