# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
978878 | Aybak | 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 <vector>
std::vector<int> construct_permutation(long long k) {
vector<int> out(k - 1);
for (long long i = 0; i < k - 1; ++i) {
out[i * -1 + k - 2] = i; }
return out; }