#include <iostream> #include <vector> using namespace std; int pot[21], pref[1000005]; vector<int> v; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; pot[0] = 1; for(int i = 1; i <= 20; ++i) pot[i] = pot[i - 1] * 2; for(int i = 1 ; i <= n; ++i) { pref[i] = pref[i - 1]; for(int j = 0; j <= 20; ++j) { if(i & pot[j]) ++pref[i]; } } int k = n; for(int i = n; i >= 0; --i) { if(!k) break; if(pref[i] < k) { k -= (pref[i + 1] - pref[i]); v.push_back(i + 1); } } cout << (int)v.size() << "\n"; for(int i = 0; i < (int)v.size(); ++i) { cout << v[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 42 43 44 45 46 47 48 49 | #include <iostream> #include <vector> using namespace std; int pot[21], pref[1000005]; vector<int> v; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; pot[0] = 1; for(int i = 1; i <= 20; ++i) pot[i] = pot[i - 1] * 2; for(int i = 1 ; i <= n; ++i) { pref[i] = pref[i - 1]; for(int j = 0; j <= 20; ++j) { if(i & pot[j]) ++pref[i]; } } int k = n; for(int i = n; i >= 0; --i) { if(!k) break; if(pref[i] < k) { k -= (pref[i + 1] - pref[i]); v.push_back(i + 1); } } cout << (int)v.size() << "\n"; for(int i = 0; i < (int)v.size(); ++i) { cout << v[i] << " "; } return 0; } |