#include "perm.h"
using namespace std;
#include <iostream>
#include <random>
#include <functional>
#include <cassert>
#include <map>
using ll = long long;
std::vector<int> construct_permutation(long long k, bool v)
{
if (k == 1)
return {};
if (k == 3)
return {1, 0};
if (k == 4)
return {2, 1, 0};
if (k % 2 == 0)
{
vector<int>a = construct_permutation(k / 2, v);
a.push_back((int)a.size());
return a;
}
if (k % 4 == 3)
{
vector<int>a = construct_permutation(k - 3, true);
for (int &i : a)
if (i >= 2)
i++;
a.push_back(2);
return a;
}
if (k % 2 == 1)
{
vector<int>a = construct_permutation(k - 1, v);
a.insert(a.begin(), (int)a.size());
return a;
}
assert(false);
return {};
}
vector<int> construct_permutation(long long k)
{
return construct_permutation(k, false);
}
