# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
414489 | aris12345678 | Rack (eJOI19_rack) | C++14 | 9 ms | 8120 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 mxN = 1e6+5;
const int mod = 1e9+7;
long long pow_2[mxN];
int main() {
int n;
long long k;
scanf("%d %lld", &n, &k);
pow_2[0] = 1LL;
for(int i = 1; i < mxN; i++) {
pow_2[i] = 2*pow_2[i-1];
pow_2[i] %= mod;
}
long long pos = 1LL;
for(int i = n-1; i >= 0; i--) {
if((k&1LL) == 0LL) {
pos += pow_2[i];
pos %= mod;
}
k += 1LL;
k >>= 1LL;
}
printf("%lld\n", pos);
return 0;
}
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... |