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
70
71
72
73
74
75
76
77
78
79
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define FOR(i, l, r) for (auto i = (l); i <= (r); ++i)
#define REP(i, n) FOR (i, 0, (n)-1)
#define ssize(x) int(x.size())
template<class A, class B>
auto&
operator<<(ostream& o, pair<A, B> p)
{
  return o << "(" << p.first << ", " << p.second << ")";
}
template<class T>
auto
operator<<(ostream& o, T x) -> decltype(x.end(), o)
{
  o << "{";
  int i = 0;
  for (auto e : x) o << (", ") + 2 * !i++ << e;
  return o << "}";
}
#ifdef DEBUG
#define debug(x...)                                                            \
  cerr << "[" #x "]: ", [](auto... $) { ((cerr << $ << "; "), ...); }(x),      \
    cerr << '\n'
#else
#define debug(...)                                                             \
  {                                                                            \
  }
#endif

int
count_bits(int n)
{
  if (n <= 1)
    return n;
  int x = sizeof(int)*CHAR_BIT - __builtin_clz(n) - 1;
  return x * (1 << (x - 1)) + n - (1 << x) + 1 + count_bits(n - pow(2, x));
}

int
find_x(int n, int l, int r)
{
  int mid = (l + r) >> 1;
  if (l == r) return mid;
  int sb = count_bits(mid);
  if (sb < n)
    return find_x(n, mid + 1, r);
  return find_x(n, l, mid);
}

int
main()
{
  cin.tie(0)->sync_with_stdio(0);

  // Input
  int n;
  cin >> n;

  // Obtain the sequence
  int limit = 120206;
  vector<int> out;
  while(n)
  {
    // Find the smallest x such that sum of bits of numbers from 1 to
    // x is greater or equal n
    int x = find_x(n, 1, limit);
    n -= __builtin_popcount(x);
    limit = x - 1;
    out.push_back(x);
  }

  // Output
  cout << out.size() << "\n";
  for (auto x : out) cout << x << " ";
  cout << "\n";
  return 0;
}