#include <bits/stdc++.h> using namespace std; vector <int> ans; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; int i = 1; while (n - __builtin_popcount(i) >= 0) { n -= __builtin_popcount(i); ans.push_back(i++); } if (n != 0) { ans.push_back(i); n -= __builtin_popcount(i); reverse(ans.begin(), ans.end()); vector <bool> good(ans.size(), true); for (int j = 1; j < ans.size(); j++) { if (n + __builtin_popcount(ans[j]) <= 0) { n += __builtin_popcount(ans[j]); good[j] = false; if (n == 0) break; } } int xd = 0; for (auto x: good) xd += x; cout << xd << '\n'; for (int j = 0; j < ans.size(); j++) if (good[j]) cout << ans[j] << ' '; } else { reverse(ans.begin(), ans.end()); cout << ans.size() << '\n'; for (auto i: ans) cout << i << ' '; } }
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 | #include <bits/stdc++.h> using namespace std; vector <int> ans; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; int i = 1; while (n - __builtin_popcount(i) >= 0) { n -= __builtin_popcount(i); ans.push_back(i++); } if (n != 0) { ans.push_back(i); n -= __builtin_popcount(i); reverse(ans.begin(), ans.end()); vector <bool> good(ans.size(), true); for (int j = 1; j < ans.size(); j++) { if (n + __builtin_popcount(ans[j]) <= 0) { n += __builtin_popcount(ans[j]); good[j] = false; if (n == 0) break; } } int xd = 0; for (auto x: good) xd += x; cout << xd << '\n'; for (int j = 0; j < ans.size(); j++) if (good[j]) cout << ans[j] << ' '; } else { reverse(ans.begin(), ans.end()); cout << ans.size() << '\n'; for (auto i: ans) cout << i << ' '; } } |