#include <bits/stdc++.h> using namespace std; int n; vector <int> sumy; int policz_sume_bitow(int x) { int s = 0; while (x != 0) { s += x%2; x /= 2; } return s; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; sumy.push_back(0); for (int i = 1; i <= n; i++) sumy.push_back(policz_sume_bitow(i)); int suma = 0; int i = 1; while (suma < n) { suma += sumy[i]; i++; } if (suma == n) { cout << i-1 << "\n"; for (int j = i-1; j >= 1; j--) cout << j << " "; } else { int k = i-1; while (sumy[k] != suma-n) k--; cout << i-2 << "\n"; for (int j = i-1; j >= 1; j--) if (j != k) cout << j << " "; } exit(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 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 64 65 66 | #include <bits/stdc++.h> using namespace std; int n; vector <int> sumy; int policz_sume_bitow(int x) { int s = 0; while (x != 0) { s += x%2; x /= 2; } return s; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; sumy.push_back(0); for (int i = 1; i <= n; i++) sumy.push_back(policz_sume_bitow(i)); int suma = 0; int i = 1; while (suma < n) { suma += sumy[i]; i++; } if (suma == n) { cout << i-1 << "\n"; for (int j = i-1; j >= 1; j--) cout << j << " "; } else { int k = i-1; while (sumy[k] != suma-n) k--; cout << i-2 << "\n"; for (int j = i-1; j >= 1; j--) if (j != k) cout << j << " "; } exit(0); } |