codeforces 687C (纸币dp)(状态不好想)
2017-05-05 21:13
316 查看
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.
Example
Input
6 18
5 6 1 10 12 2
Output
16
0 1 2 3 5 6 7 8 10 11 12 13 15 16 17 18
Input
3 50
25 25 50
Output
3
0 25 50
题意:给你 n种纸币 让你凑出 k元。问拿来凑的这些钱能拿来凑出什么样的面值。
dp[i][j] i为总钱数,j是钱数,存的是 有i钱能否凑出j钱。
dp[i][j] 只有两种转移方式 dp[i-m][j]
或者 dp[i-m][j-m] 然后转移即可,要注意边界
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.
Example
Input
6 18
5 6 1 10 12 2
Output
16
0 1 2 3 5 6 7 8 10 11 12 13 15 16 17 18
Input
3 50
25 25 50
Output
3
0 25 50
题意:给你 n种纸币 让你凑出 k元。问拿来凑的这些钱能拿来凑出什么样的面值。
dp[i][j] i为总钱数,j是钱数,存的是 有i钱能否凑出j钱。
dp[i][j] 只有两种转移方式 dp[i-m][j]
或者 dp[i-m][j-m] 然后转移即可,要注意边界
#include <bits/stdc++.h> using namespace std; int dp[1010][1010]; vector<int> ans; int main() { int n,K; cin>>n>>K; dp[0][0]=1; for(int i=0;i<n;i++) { int m; cin>>m; for(int j=K;j>=m;j--) { for(int k=0;k<=K;k++) { dp[j][k]=dp[j][k]||dp[j-m][k]; if(k>=m) dp[j][k]=dp[j][k]||dp[j-m][k-m]; } } } for(int i=0;i<=K;i++) if(dp[K][i]) { ans.push_back(i); 4000 } sort(ans.begin(),ans.end()); int l=ans.size();cout<<l<<endl; for(int i=0;i<l;i++) printf("%d ",ans[i] ); }
相关文章推荐
- Codeforces 11D A Simple Task (状态压缩DP)
- CodeForces 11D - A Simple Task 状态压缩DP
- CodeForces - 687C_The Values You Can Make_DP
- Codeforces 149 D Coloring Brackets(区间dp,标记状态,dfs)
- codeforces 8C - Looking for Order 状态DP
- codeforces 152E Garden(状态压缩dp)
- Codeforces 4538 (状态压缩dp)Little Pony and Harmony Chest
- codeforces 580D Kefa and Dishes【状态压缩+dp】
- codeforces 83E Two Subsequences (状态dp,难)
- CodeForces 21D - Traveling Graph 欧拉回路的性质+状态压缩DP
- CodeForces - 165E(状态压缩dp)
- CodeForces 55D Beautiful numbers (数位DP+状态简化,5级)
- codeforces 453B Little Pony and Harmony Chest (离散化+dp状态压缩)
- codeforces 9D How many trees?(DP,注意状态表示方法)
- Codeforces 8C Looking for Order(状态压缩DP)
- CodeForces 55D Beautiful numbers (数位DP+状态简化,5级)
- codeforces 16E Fish(状态压缩概率DP)
- codeforces 687C - The Values You Can Make 简单dp
- codeforces 626F DP 如何设置状态,方便转移
- CodeForces 687C - The Values You Can Make(01背包dp)