#include <bits/stdc++.h> using namespace std; int b(int n) { int o = 0; while (n != 0) { if (n % 2 == 1) { o++; } n /= 2; } return(o); } int main() { int n; cin >> n; vector<int> o(0, 0); int i = 0, s = 0; bool r = false; while (s < n) { o.push_back(i); //cout << i << " "; s += b(i); i++; } //cout << "\n"; if (s == n) { cout << o.size() - 1 << "\n"; } else { cout << o.size() - 2 << "\n"; } for (int j = o.size() - 1; j > 0; j--) { if (b(j) != s - n) { cout << o[j] << " "; } else if(r == true) { cout << o[j] << " "; } else { r = true; } } }
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 | #include <bits/stdc++.h> using namespace std; int b(int n) { int o = 0; while (n != 0) { if (n % 2 == 1) { o++; } n /= 2; } return(o); } int main() { int n; cin >> n; vector<int> o(0, 0); int i = 0, s = 0; bool r = false; while (s < n) { o.push_back(i); //cout << i << " "; s += b(i); i++; } //cout << "\n"; if (s == n) { cout << o.size() - 1 << "\n"; } else { cout << o.size() - 2 << "\n"; } for (int j = o.size() - 1; j > 0; j--) { if (b(j) != s - n) { cout << o[j] << " "; } else if(r == true) { cout << o[j] << " "; } else { r = true; } } } |