Submission #1651042

---

Source Code Expand

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

typedef long long LL;

LL n;
deque<int> ans;

int main() {
	cin >> n;
	++n;
	for (int i = 0, cur = 0; n>>i; ++i) {
		if (n>>i&1) {
			ans.push_front(++cur);
		} else {
			ans.push_back(++cur);
		}
	}
	for (deque<int>::iterator it = ans.begin(); it != ans.end(); ++it) {
		printf("%d ", *it);
	}
	for (int i = 1, l = ans.size(); i <= l; ++i) {
		printf("%d%c", i, " \n"[i == l]);
	}
	return 0;
}

Submission Info

Judge Result