# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
739427 | CyberCraze | 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>
#define ll long long
#define FOR(i,a,b) for(ll i=a;i<b;i++)
using namespace std;
vector<int> construct_permutation1(ll k){
ll lbit=__lg(k);
vector<int> ans;FOR(i,0,lbit)ans.push_back(i);
for (int i = lbit - 1; i >= 0; i--) {
if ((k >> i) & 1) {
ans.insert(ans.begin() + i, lbit++);
}
}
return ans;
}