# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
833613 | tolbi | Rack (eJOI19_rack) | C++17 | 1 ms | 300 KiB |
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 int MOD = 1e9+7;
#define tol(bi) (1LL<<((int)(bi)))
int solve(int n, long long k){
if (n>64 || k>tol(n-1)){
return ((long long)solve(n-1,k)*2ll)%MOD;
}
else {
if (k==1){
return 1ll;
}
int nek = k/2;
if (k%2){
return solve(n-1,k/2+1);
}
else {
return (solve(n-1,k/2)+tol(n-1))%MOD;
}
}
}
int main(){
long long n,k;
cin>>n>>k;
cout<<solve(n,k)<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |