# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
979043 | rshohruh | 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 "perm.h"#include "bits/stdc++.h"using namespace std;int count_zeros(long long k){ return k ? ((k&1)^1) + count_zeros(k>>1) : 0;}vector<int> construct_permutation(long long k){ --k; vector<int> a; while(count_zeros(k - ((1LL<<a.size())-1)) > a.size()) a.push_back(a.size()); k -= (1LL<<a.size()) - 1; for(int i = 0; k > 0; ++ i){ if((k>>i)&1){ a.insert(a.begin()+i, a.size()); k -= 1ll<<i; } } return a;}