| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 724099 | AlfaGenus | 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<bits/stdc++.h>
#include<perm.h>
vector<long long> construct_permutation(long long n){
vector<long long> ans(n);
for(long long i = 0; i < n; i ++)
ans[i] = n - i - 1;
return ans;
}