| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 980631 | Nexus | Permutation (APIO22_perm) | C++17 | 1 ms | 560 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 ll long long
using namespace std;
const ll N=1e6+9,M=2e18+9,mod=1e9+7;
ll a[66],q,k,x,y,z;
vector<int>v;
ll po(ll X,ll Y)
{
if(!Y)return 1;
if(Y&1)return X*po(X,Y-1);
ll ret=po(X,Y/2);
return ret*ret;
}
ll log2(ll k)
{
ll g=0;
while(k>1)k/=2,++g;
return g;
}
vector<int>construct_permutation(ll k)
{
x=log2(k);
v.clear();
y=x-1;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||