# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466174 | MKutayBozkurt | Rack (eJOI19_rack) | C++14 | 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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
int32_t main() {
ios::sync_with_stdio(0); cin.tie(0);
function<int(int, int)> power = [&](int a, int b) {
int ans = 1;
while (b) {
if (b & 1) ans = ans * a % mod;
a = a * a % mod;
b /= 2;
ans %= mod;
}
return ans % mod;
};
function<int(int, int)> f = [&](int n, int k) {
if (n == 0ll) return 1ll;
if (k & 1) {
return f(n - 1, (k + 1) / 2);
} else {
return f(n - 1, k / 2) + power(2, n - 1) % mod;
}
};
int n, k; cin >> n >> k;
cout << f(n, k) << '\n';
}