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;

void solve() {
    int n;
    cin >> n;

    vector<int> popcounts(n + 1);
    for (int i = 1; i <= n; i++) {
        popcounts[i] = bitset<32>(i).count();
    }

    vector<int> prefsums(n + 1); 
    for (int i = 1; i <= n; i++) {
        prefsums[i] = prefsums[i - 1] + popcounts[i];
    }

    vector<int> ans;
    for (int i = n; i > 0; i--) {
        if (prefsums[i - 1] < n) {
            n -= popcounts[i];
            ans.push_back(i); 
        }
    }

    cout << ans.size() << "\n";
    for (int elem : ans) {
        cout << elem << " ";
    }
    cout << "\n";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    solve();
  
    return 0;
}