#include <iostream> #include <vector> using namespace std; #define MAX_O 120300 int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; int tab[MAX_O]; int s = 0; for(int i = 0; i < MAX_O; i++) { s += __builtin_popcount(i); tab[i] = s; } int x = 0; while (tab[x] < n) x++; int y = tab[x]; vector<int> odp; while(x > 0 && (y - n >= 0)) { if ((y - n > 0) && (__builtin_popcount(x) <= y - n)) { y -= __builtin_popcount(x); } else { odp.push_back(x); } x--; } cout << odp.size() << endl; for(auto i : odp) cout << i << " "; return 0; }
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 | #include <iostream> #include <vector> using namespace std; #define MAX_O 120300 int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; int tab[MAX_O]; int s = 0; for(int i = 0; i < MAX_O; i++) { s += __builtin_popcount(i); tab[i] = s; } int x = 0; while (tab[x] < n) x++; int y = tab[x]; vector<int> odp; while(x > 0 && (y - n >= 0)) { if ((y - n > 0) && (__builtin_popcount(x) <= y - n)) { y -= __builtin_popcount(x); } else { odp.push_back(x); } x--; } cout << odp.size() << endl; for(auto i : odp) cout << i << " "; return 0; } |