| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 975951 | Orifkhon | Permutation (APIO22_perm) | C++17 | 484 ms | 49188 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.
// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
#include <perm.h>
using namespace std;
vector<int> construct_permutation(long long k) {
vector<int> arr(k - 1);
int ind = 0;
for(int i = k - 2; i >= 0; i--){
arr[ind] = i;
ind++;
}
return arr;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
