#include<bits/stdc++.h> using namespace std; using LL=long long; #define FOR(i,l,r) for(int i=(l);i<=(r);++i) #define REP(i,n) FOR(i,0,(n)-1) #define ssize(x) int(x.size()) template<class A,class B>auto&operator<<(ostream&o,pair<A,B>p){return o<<'('<<p.first<<", "<<p.second<<')';} template<class T>auto operator<<(ostream&o,T x)->decltype(x.end(),o){o<<'{';int i=0;for(auto e:x)o<<(", ")+2*!i++<<e;return o<<'}';} #ifdef DEBUG #define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...);}(x),cerr<<'\n' #else #define debug(...) {} #endif int main() { cin.tie(0)->sync_with_stdio(0); int n; cin >> n; vector<int> sum(n + 1), val(n + 1); FOR(i, 1, n) { val[i] = __builtin_popcount(i); sum[i] = sum[i - 1] + val[i]; } debug(n, val, sum); vector<int> ans; int ptr = n; while (n > 0) { if (sum[ptr - 1] >= n) { --ptr; } else { ans.emplace_back(ptr); n -= val[ptr]; --ptr; } } cout << ssize(ans) << '\n'; for (auto e : ans) cout << e << ' '; cout << '\n'; }
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 | #include<bits/stdc++.h> using namespace std; using LL=long long; #define FOR(i,l,r) for(int i=(l);i<=(r);++i) #define REP(i,n) FOR(i,0,(n)-1) #define ssize(x) int(x.size()) template<class A,class B>auto&operator<<(ostream&o,pair<A,B>p){return o<<'('<<p.first<<", "<<p.second<<')';} template<class T>auto operator<<(ostream&o,T x)->decltype(x.end(),o){o<<'{';int i=0;for(auto e:x)o<<(", ")+2*!i++<<e;return o<<'}';} #ifdef DEBUG #define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...);}(x),cerr<<'\n' #else #define debug(...) {} #endif int main() { cin.tie(0)->sync_with_stdio(0); int n; cin >> n; vector<int> sum(n + 1), val(n + 1); FOR(i, 1, n) { val[i] = __builtin_popcount(i); sum[i] = sum[i - 1] + val[i]; } debug(n, val, sum); vector<int> ans; int ptr = n; while (n > 0) { if (sum[ptr - 1] >= n) { --ptr; } else { ans.emplace_back(ptr); n -= val[ptr]; --ptr; } } cout << ssize(ans) << '\n'; for (auto e : ans) cout << e << ' '; cout << '\n'; } |