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;
long long MOD = (1000*1000*1000)+7;
long long puis(int a, int b) {
long long res =1 ;
for (int i=0;i<b;i++) res = res*a;
return res;
}
long long val(int niveau, long pos) {
if (niveau == 1) {
if (pos == 1) return 1;
else return 2;
}
if (niveau >= 61) {
long long res = val(niveau-1, pos);
res = ((res*2) - 1)%MOD ;
return res;
}
if (pos <= (puis(2, niveau-1))) {
long long res = val(niveau-1, pos);
res = ((res*2)- 1)%MOD;
return res;
}
else {
pos -= puis(2, niveau-1);
long long res = val(niveau-1, pos);
res = (res*2)%MOD;
return res;
}
}
int main() {
long long n, k;
cin >> n >> k;
cout << val(n, k);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |