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
#include <bits/stdc++.h> // Adam Naskręcki

using namespace std;

typedef long long ll;

int bits(int i) {
    int n = i;
    int cnt = 0;
    while (n) {
        cnt += 1 & n;
        n >>= 1;
    }

    return cnt;
}

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

    int n;
    cin >> n;

    int b[10 * n];
    for (int i = 0; i < 10 * n; i++) {
        b[i] = bits(i);
    }

    int k0 = 1;
    int S = b[1];
    while (S < n) {
        k0++;
        S += b[k0];
    }

    vector<int> res;
    for (int i = k0; i >= 0; i--) {
        if (S - b[i] < n) {
            res.push_back(i);
            n = n - b[i];
        }
        S -= b[i];
    }

    cout << res.size() << "\n";
    for (int i = 0; i < res.size(); i++) {
        cout << res[i] << " ";
    }
    cout << "\n";

    return 0;
}