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
const ll mod = 1e9 + 7;
long long exp(long long x, long long y, long long p) {
long long res = 1; x %= p;
while (y) {
if (y & 1) {
res *= x; res %= p;
}
x *= x; x %= p;
y >>= 1;
}
return res;
}
int main(){
ll n , k;cin >> n >> k;
-- k;
ll ans = 1;
for(int i = 0;i <= log(k) + 1;i ++){
if((1 << i) & k){
ans = (ans + exp(2 , n - i - 1 , mod)) % mod;
}
}
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |