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
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int bitsOn(int x)
{
	int w=0;
	while(x>0)
	{
		w+=x&1;
		x=x>>1;
	}
	return w;
}
int main() 
{
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int x,n,m,l,il;
    bool *p;
    int *t;
    cin>>n;
    p=new bool[n+1];
    t=new int[n+1];
    vector<int> Stack;
    m=n;
    l=n;
    il=0;
    for(int i=n;i>=1;--i)
    {
		p[i]=0;
		t[i]=-1;
		Stack.push_back(i);

	}
	for(int i=0;i<n;++i)
	{
		m=Stack[Stack.size()-1];
		Stack.pop_back();
		x=bitsOn(m);
		if(x==1)
		{
			p[m]=1;
			t[1]=m;
			il++;
		}
		else
		{
			l=t[x-1];
			Stack.push_back(l);
			p[l]=0;
			p[m]=1;
			t[x]=max(m,t[x]);
		}
	}
	cout<<il<<'\n';
	m=0;
	for(int i=n;i>=0;--i)
	{
		if(m==n)
		{
			break;
		}
		else
		{
			if(p[i])
			{
				cout<<i<<' ';
				m+=bitsOn(i);
			}
			
		}
	}
	delete [] p;
	delete [] t;
	
	return 0;
}