# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
974357 | IUA_Hasin | Permutation (APIO22_perm) | C++17 | 12 ms | 1372 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>
#define endl "\n"
#define ll long long
using namespace std;
ll close_pow(ll n){
ll a = 1;
ll b = pow(2, a)-1;
ll ans = 1;
while(n>b){
// cout<<b<<endl;
ans++;
b = (ll)(pow(2, ans)-1);
if(b>n){
ans--;
break;
} else if(b==n){
break;
}
// cout<<b<<endl;
}
return ans;
}
std::vector<ll> dunno(ll n){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |