Submission #1721598

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
 
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;
vi ans;
void insert(int pos, int v)
{
	ans.insert(ans.begin()+pos,v);
}
int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	ll n; cin>>n;
	ll res=0;
	
	int cur=0;
	for(ll i = 0; i <= 50; i++)
	{
		if(res+(1LL<<i)<=n)
		{
			res+=(1LL<<i);
			insert(i,++cur);
			insert(0,cur);
		}
	}
	n-=res;
	for(int i = 50; i >= 0; i--)
	{
		if(n&(1LL<<i))
		{
			int pos = int(ans.size()) - i;
			insert(pos,++cur);
			insert(0,cur);
		}
	}
	cout<<ans.size()<<'\n';
	for(int i=0;i<ans.size();i++)
	{
		cout<<ans[i];
		if(i+1<ans.size()) cout<<' ';
	}
	cout<<'\n';
}	

Submission Info

Judge Result