# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
698527 | MrM7md | 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;
#define F first
#define S second
#define int long long
#define endl '\n'
const int N=1e6;
const int H=1e7;
vector<int> construct_permutation(int x){
int k=log2(x);
if((1<<k)!=x)k++;
vector<int>ans;
for(int i=0;i<k;i++)ans.push_back(i);
return ans;
}