# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
916499 | wii | Permutation (APIO22_perm) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include <perm.h>
using namespace std;
void dnc(deque<int> &v, int id, int u) {
if (id < 0) return;
if (u & 1) {
dnc(v, id - 1, u >> 1);
v.push_back(id);
} else {
dnc(v, id - 1, u - 1);
v.push_front(id);
}
}
vector<int> construct_permutation(int k) {
k -= 1;
int cnt = 0;
for (int x = k; x > 0; x = (~x & 1 ? --x : x >> 1), ++cnt);
deque<int> ans;
dnc(ans, cnt - 1, k);
return vector<int>(ans.begin(), ans.end());
}
signed main() {
int k;
cin >> k;
vector<int> ans;
ans = construct_permutation(k);
for (int u: ans) cout << u << " ";
}