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;
using ll = long long;
using vi = vector<int>;
vi construct_permutation(ll k) {
if(k == 1) return {};
if(k == 2) return vi{0};
for(int i: {2, 3, 5, 7, 11, 13, 17, 19, 23, 29}) {
if(k % i == 0 && k > i) {
vi l = construct_permutation(k / i);
vi r = construct_permutation(i);
for(auto& x: r) x += l.size();
l.insert(l.end(), r.begin(), r.end());
return l;
}
}
vi a = construct_permutation(k / 2);
a.push_back(a.size());
if(k & 1) a.insert(a.begin(), a.size());
return a;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |