Submission #1201933

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define FOR(i,l,r) for(int i = (int) (l);i < (int) (r);i++)
#define ALL(x) x.begin(),x.end()
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typedef long long ll;

ll N;

int main()
{
	cin >> N;
	N++;

	deque<int> d;
	ll c = N;
	while(c){
		d.push_front(c & 1);
		c >>= 1;
	}
	
	deque<int> ans;
	int id = 1;
	FOR(i,1,d.size()){
		ans.push_back(id);
		ans.push_back(id);
		id++;
		if(d [i]){
			ans.push_front(id);
			ans.push_back(id);
			id++;
		}
	}

	FOR(i,0,ans.size()){
		cout << ans [i] << (i == ans.size() - 1 ? "\n" : " ");
	}

	return 0;
}

Submission Info

Judge Result