# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
975971 | Orifkhon | 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.
// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
#include <perm.h>
using namespace std;
#define int long long
vector<int> construct_permutation(long long k) {
int size = log2(k);
vector<int> perm(size);
for(int i = 0; i < size; i++){
perm[i] = i;
}
k-=(1 << size);
int insert = size + 1;
while(true){
if(k == 0){
break;
}
int ind = log2(k);
k-=(1 << ind);
perm.insert(perm.begin() + ind, insert);
insert++;
}
return perm;
}