#include <iostream> using namespace std; int how_many_bits(int x) { int result = 0; while (x > 0) { if (x % 2 == 1) result++; x >>= 1; } return result; } int power(int a, int b) { int w = 1; while (b > 0) { if (b % 2 == 1) w *= a; a *= a; b /= 2; } return w; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; int pow = 1, k = 1; while (k*pow < n) { k++; pow *= 2; } int m = power(2, k)-1; int vector[m]; int bits[m]; k = m; int sum_of_bits = 0; for (int i = 1; i <= m; i++) { vector[i-1] = i; bits[i-1] = how_many_bits(i); sum_of_bits += bits[i-1]; } for (int i = m-1; i >= 0; i--) { if (n + bits[i] <= sum_of_bits) { vector[i] = -1; k--; sum_of_bits -= bits[i]; if (sum_of_bits == n) break; } } cout << k << "\n"; for (int i = m-1; i >= 0; i--) if (vector[i] != -1) cout << vector[i] << " "; cout << "\n"; 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 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 67 68 69 70 71 72 73 | #include <iostream> using namespace std; int how_many_bits(int x) { int result = 0; while (x > 0) { if (x % 2 == 1) result++; x >>= 1; } return result; } int power(int a, int b) { int w = 1; while (b > 0) { if (b % 2 == 1) w *= a; a *= a; b /= 2; } return w; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; int pow = 1, k = 1; while (k*pow < n) { k++; pow *= 2; } int m = power(2, k)-1; int vector[m]; int bits[m]; k = m; int sum_of_bits = 0; for (int i = 1; i <= m; i++) { vector[i-1] = i; bits[i-1] = how_many_bits(i); sum_of_bits += bits[i-1]; } for (int i = m-1; i >= 0; i--) { if (n + bits[i] <= sum_of_bits) { vector[i] = -1; k--; sum_of_bits -= bits[i]; if (sum_of_bits == n) break; } } cout << k << "\n"; for (int i = m-1; i >= 0; i--) if (vector[i] != -1) cout << vector[i] << " "; cout << "\n"; return 0; } |