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;
using ll = long long;
ll MOD = 1e9+7;
ll calcMODpow(int b, int p) {
if (p == 0) return 1;
ll x = calcMODpow(b, p/2);
if (p % 2 == 1) {
return (((x*x) % MOD)*b) % MOD;
} else {
return (x*x) % MOD;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
ll n, k;
cin >> n >> k;
ll pos = 1, add = n;
bool inv = false;
for (ll i = 0; i < min(n, 1LL * 63); i++) {
add--;
if (inv == false) {
if ((k & (1 << i))) {
inv = 1;
} else {
pos += calcMODpow(2, add);
pos %= MOD;
}
} else {
if ((k & (1 << i))) {
pos += calcMODpow(2, add);
pos %= MOD;
} else {
inv = true;
}
}
}
cout << pos << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |