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
#include <iostream>
#include <algorithm>
using namespace std;

const int MAXN = 1e6 + 7;

pair<int, int> ciag[MAXN];

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

    int n;
    cin >> n;

    int k = 0;
    int sumaAkt = 0;
    int i = 1;
    while (sumaAkt < n) {
        ciag[i].first = i;
        ciag[i].second = __builtin_popcount(i);
        sumaAkt += ciag[i].second;
        i += 1;
        k += 1;
    }

    if (sumaAkt == n) {
        cout << k << endl;

        for (int i = k; i >= 1; i--) {
            cout << ciag[i].first << ' ';
        }
        cout << endl;
    }
    else {
        int ruznica = sumaAkt - n;
        for (int i = k; i >= 1; i--) {
            if (ciag[i].second == ruznica) {
                ciag[i].first = -100;
                k -= 1;
                break;
            }
        }

        cout << k << endl;

        for (int i = k + 1; i >= 1; i--) {
            if (ciag[i].first != -100) {
                cout << ciag[i].first << ' ';
            }
        }
        cout << endl;
    }

    return 0;
}