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
55
56
57
58
59
60
61
62
63
64
65
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstring>

typedef long long ll;
using namespace std;

int countPower(ll a) {
    int res = 0;

    while(a) {
        res += (a & 1);
        a = (a >> 1);
    }

    return res;
}


int main() {
    ios_base::sync_with_stdio(0);

    int n;
    cin >> n;

    bool* tab = new bool[n+1];
    memset(tab, 0, n+1);

    int end = 0;
    int used = 0;

    while(n > 0) {
        end++;
        used++;
        n -= countPower(end);
        tab[end] = true;
    }
    
    int itBack = end;

    while(n < 0) {
        itBack--;
        if(countPower(itBack) <= abs(n)) {
            n += countPower(itBack);
            tab[itBack] = false;
            used--;
        }
    }
    cout << used << endl;
    end++;
    while(end--) {
        if(tab[end]) {
            cout << end << " ";
        }
    }

    cout << endl;

    delete[] tab;


    return 0;
}