# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
999709 | HasanV11010238 | Rack (eJOI19_rack) | 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>
using namespace std;
#define ll long long
#define mod 1000000007
ll binpow(ll a, ll b){
ll res = 1;
if (b == -1){
return 0;
}
while (b != 0){
if (b % 2 == 0){
b /= 2;
a *= a;
if (a >= mod){
am++;
}
a %= mod;
}
else{
b -= 1;
res *= a;
if (res >= mod){
am++;
}
res %= mod;
}
}
return res;
}
vector<vector<ll>> ve;
ll ans = 1;
ll f(ll n, ll k, ll va){
ll val = 0;
if (n == 0){
return 0;
}
if (n <= 63){
ll op = pow(2, n - 1);
if (k >= op){
val += binpow(2, va);
ve.push_back({n - 1, k - op, va + 1});
ans += val;
return 0;
}
}
ve.push_back({n - 1, k, va + 1});
return 0;
}
int main(){
ll n, k;
cin>>n>>k;
k--;
ve.push_back({n, k, 0});
for (int i = 0; i < ve.size(); i++){
f(ve[i][0], ve[i][1], ve[i][2]);
ans %= mod;
}
cout<<ans;
}