#include<bits/stdc++.h>
using namespace std;
int ile_bitow[1000006];
long long suma[1000006];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int x = i;
while (x > 0) {
if (x%2 == 1)
ile_bitow[i]++;
x /= 2;
}
}
for (int i = 1; i <= n; i++) {
suma[i] = suma[i-1] + ile_bitow[i];
}
vector <int> result;
int start = n;
while (n > 0) {
int cand = n;
for (int i = start; i >= 0; i--) {
if (suma[i] >= n) {
cand = i;
}
else
break;
}
result.push_back(cand);
n -= ile_bitow[cand];
start = cand - 1;
}
cout << result.size() << "\n";
for (int i = 0; i < result.size(); i++)
cout << result[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 39 40 41 | #include<bits/stdc++.h> using namespace std; int ile_bitow[1000006]; long long suma[1000006]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 1; i <= n; i++) { int x = i; while (x > 0) { if (x%2 == 1) ile_bitow[i]++; x /= 2; } } for (int i = 1; i <= n; i++) { suma[i] = suma[i-1] + ile_bitow[i]; } vector <int> result; int start = n; while (n > 0) { int cand = n; for (int i = start; i >= 0; i--) { if (suma[i] >= n) { cand = i; } else break; } result.push_back(cand); n -= ile_bitow[cand]; start = cand - 1; } cout << result.size() << "\n"; for (int i = 0; i < result.size(); i++) cout << result[i] << " "; return 0; } |
English