# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
975516 | KK_1729 | 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;
std::vector<int> construct_permutation(long long k)
{
// vector<int> a;
// while (k > 2){
// if (k%2 == 1){
// a.pb(1);
// k--;
// }else{
// a.pb(0);
// k/=2;
// }
// }
// reverse(a.begin(), a.end());
// int mini = 0; int maximum = 2;
// cout <<
vector<int> ans;
for (int i = k-1; i >= 0; i--) ans.pb(i);
return ans;
}