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
66
67
68
69
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include <bits/stdc++.h>
using namespace std;
#define sim template < class c
#define ris return * this
#define mor > muu & operator << (
#define R22(r) sim > typename \
  enable_if<1 r sizeof dud<c>(0), muu&>::type operator<<(c g) {
sim > struct rge {c b, e; };
sim > rge<c> range(c h, c n) { return {h, n}; }
sim > auto dud(c * r) -> decltype(cerr << *r);
sim > char dud(...);
struct muu {
#ifdef LOCAL
stringstream a;
~muu() { cerr << a.str() << endl; }
R22(<) a << boolalpha << g; ris; }
R22(==) ris << range(begin(g), end(g)); }
sim, class b mor pair < b, c > r) { ris << "(" << r.first << ", " << r.second << ")"; }
sim mor rge<c> u) {
a << "[";
for (c i = u.b; i != u.e; ++i) 
  *this << ", " + 2 * (i == u.b) << *i;
 ris << "]";
 }
#else
sim mor const c&) { ris; }
#endif
muu & operator()() { ris; }
};
#define imie(r...) "[" #r ": " << (r) << "] "
#define debug (muu() << __FUNCTION__ << "#" << __LINE__ << ": ")

int res[1000000];

vector<int> find(int max, int count) {
	vector<int> result;
	int current_sum = res[max];
	for(int i = max ; i >= 1; i --) {
		if (current_sum - __builtin_popcount(i) >= count) {
			current_sum -= __builtin_popcount(i);
		} else {
			result.push_back(i);
		}
	}
	return result;
}

int main() {
	ios_base::sync_with_stdio(0);
	res[1] = 1;
	for (int i = 2; i < 200 * 1000; i ++) {
		res[i] = res[i-1] + __builtin_popcount(i);
	}
	int n;
	cin >> n;
	for (int i = 1; i <= n; i ++) {
		if (res[i] >= n) {
			vector<int> v = find(i, n);
			cout << v.size() << "\n";
			for (int x : v) {
				cout << x << " ";
			}
			return 0;
		}
	}
}