| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 731987 | parsadox2 | 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>
#define pb push_back
#define F first
#define S second
#define debug(x) cout << #x << "= " << x << ", "
#define ll long long
#define fast ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define SZ(x) (int) x.size()
#define wall cout << endl;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
string inttostr(int x)
{
int k = 1;
while(k * 2 <= x) k *= 2;
string res;
for(int i = k ; i > 0 ; i >>= 1)
{
if((x & i) != 0) res.pb('1');
else res.pb('0');
}
return res;
}
vvector <int> construct_permutation(long long k)
{
vector <int> res;
if(k <= 90)
{
for(int i = k - 2 ; i >= 0 ; i--) res.pb(i);
}
return res;
}