# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
582682 | 2022-06-24T09:10:42 Z | Vanilla | Permutation (APIO22_perm) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; vector<int> construct_permutation(ll k) { --k; int m = 1; while(k+1 > (1ll<<(m))) { ++m; } vector<int> perm(m); for (int i = 0; i < m; ++i) { perm[i] = i; } for (int i = m-2; i >= 0; --i) { if ((k & (1ll << i)) == 0) swap(perm[i],perm[i+1]); } return perm; }