#include <bits/stdc++.h> #include "perm.h" using namespace std; vector<int> construct_permutation(long long k){ if (k==1){return {};} if (k==2){return vector<int>{0};} if (k%2==0 && k>2){ vector <int> v = construct_permutation(k/2); v.push_back(v.size()); return v; } vector<int> v=construct_permutation(k/2); v.push_back(v.size()); vector<int> b; b.push_back(v.size()); for (int i=0; i<v.size(); i++){ b.push_back(v[i]); } return b; }