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;
const long long M = (1e9 + 7);
long long n, k, ans;
void f(long long x, long long l, int y){
if(y == -1){
ans = l;
return;
}
if(x % 2 == 0){
long long z = 1;
for(int i = 0; i < y; i++){
z *= 2;
z %= M;
}
l += z;
l %= M;
}
if(x >= 2) x++, x /= 2;
f(x,l,y-1);
}
int main(){
cin >> n >> k;
f(k,1,n-1);
ans %= M;
cout << ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |