#include<bits/stdc++.h> #define st first #define nd second #define pb(x) push_back(x) #define pp(x) pop_back(x) #define mp(a, b) make_pair(a, b) #define all(x) (x).begin(), (x).end() #define rev(x) reverse(all(x)) #define sor(x) sort(all(x)) #define sz(x) (int)(x).size() #define rsz(x) resize(x) using namespace std; typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<pii > vii; typedef vector<ll> vl; typedef vector<pll> vll; typedef string str; #define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); const int MK = 500009; int zapal[MK]; int pref[MK]; void build(){ pref[0] = 0; zapal[0] = 0; for(int i = 1; i < MK; i++){ zapal[i] = __builtin_popcount(i); pref[i] = pref[i-1] + zapal[i]; } } int n ; void run(){ cin >> n; int ind = MK -1 ; vi ans; ans.reserve(10000); while(n > 0){ while(pref[ind-1] >= n) ind--; ans.pb(ind); n -= zapal[ind]; ind--; } cout << sz(ans) << "\n"; for(auto x : ans) cout << x << ' '; } int main(){ BOOST build(); run(); }
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 | #include<bits/stdc++.h> #define st first #define nd second #define pb(x) push_back(x) #define pp(x) pop_back(x) #define mp(a, b) make_pair(a, b) #define all(x) (x).begin(), (x).end() #define rev(x) reverse(all(x)) #define sor(x) sort(all(x)) #define sz(x) (int)(x).size() #define rsz(x) resize(x) using namespace std; typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<pii > vii; typedef vector<ll> vl; typedef vector<pll> vll; typedef string str; #define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); const int MK = 500009; int zapal[MK]; int pref[MK]; void build(){ pref[0] = 0; zapal[0] = 0; for(int i = 1; i < MK; i++){ zapal[i] = __builtin_popcount(i); pref[i] = pref[i-1] + zapal[i]; } } int n ; void run(){ cin >> n; int ind = MK -1 ; vi ans; ans.reserve(10000); while(n > 0){ while(pref[ind-1] >= n) ind--; ans.pb(ind); n -= zapal[ind]; ind--; } cout << sz(ans) << "\n"; for(auto x : ans) cout << x << ' '; } int main(){ BOOST build(); run(); } |