# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
975928 | 2024-05-06T03:33:32 Z | Orifkhon | Permutation (APIO22_perm) | C++17 | 0 ms | 0 KB |
int[] construct_permutation(long long k) { int z = __lg(k); vector<int> p(z); iota(p.begin(), p.end(), 0); for (int i = z - 1; i >= 0; i--) { if ((k >> i) & 1) { p.insert(p.begin() + i, z++); } } return p; }