#include <iostream> #include <vector> using namespace std; int countBits(int n) { int bits = 0; while (n > 0) { bits += (int)(n & 1); n /= 2; } return bits; } pair<int, int> kiedy[1000007]; // <jaka liczba, ile bitow> int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin>>n; int m = 0; int l = 1; while (m < n) { int bits = countBits(l); for (int j = 1; j <= bits && m <= n; j++) { m++; kiedy[m] = {l, bits}; } l++; } vector<int> v; while (n > 0) { v.push_back(kiedy[n].first); n -= kiedy[n].second; } cout << v.size() << "\n"; for (int i = 0; i < v.size(); i++) { cout << v[i] << " "; } // for (int i = 0; i <= n; i++) cout <<tab[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 | #include <iostream> #include <vector> using namespace std; int countBits(int n) { int bits = 0; while (n > 0) { bits += (int)(n & 1); n /= 2; } return bits; } pair<int, int> kiedy[1000007]; // <jaka liczba, ile bitow> int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin>>n; int m = 0; int l = 1; while (m < n) { int bits = countBits(l); for (int j = 1; j <= bits && m <= n; j++) { m++; kiedy[m] = {l, bits}; } l++; } vector<int> v; while (n > 0) { v.push_back(kiedy[n].first); n -= kiedy[n].second; } cout << v.size() << "\n"; for (int i = 0; i < v.size(); i++) { cout << v[i] << " "; } // for (int i = 0; i <= n; i++) cout <<tab[i] <<" "; } |