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;
typedef long long ll;
const int MOD = 1e9+7;
int main(){
int n; ll k;
cin >> n >> k;
k--;
ll v=1;
for(int i=0;i<n;i++){
if(k%2==0){
v=v*2%MOD;
} else {
v=v*2+1%MOD;
}
k=k/2;
}
ll p=1;
for(int i=0;i<n;i++){
p=p*2%MOD;
}
cout << v-p+1;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |