-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathB_The_Child_and_Set.cpp
96 lines (92 loc) · 2.07 KB
/
B_The_Child_and_Set.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
// find a set with given sum
vector<int> sumrec(int idx,int sum,int arr[],vector<int>& res){
if(sum==0)
return res;
res.push_back(arr[idx]);
return sumrec(idx+1,sum-arr[idx],arr,res);
res.pop_back();
return sumrec(idx+1,sum,arr,res);
}
int main()
{
fast_cin();
int sum,limit;
cin>>sum>>limit;
int arr[limit];
for(int i=1;i<=limit;i++)
{
arr[i-1]=i&~(i-1); //to find position of rightmost set bit
}
vector<int>res;
int dp[limit+1][sum+1];
for(int i=0;i<=limit;i++)
{
dp[i][0]=0;
}
for(int i=0;i<=sum;i++)
{
dp[0][i]=0;
}
for(int i=1;i<=limit;i++)
{
for(int j=1;j<=sum;j++)
{
}
}
cout<<res.size()<<'\n';
for(auto x: res)
{
cout<<x<<" ";
}
return 0;
}