# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
410457 | radaiosm7 | Rack (eJOI19_rack) | C++98 | 10 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;
int n, i;
long long k, pos;
const long long MOD = 1000000007LL;
long long po[1000005];
int main() {
scanf("%d%lld", &n, &k);
pos = 1LL;
po[0] = 1LL;
for (i=1; i < 1000005; ++i) {
po[i] = (po[i-1]*2LL)%MOD;
}
for (i=n-1; i >= 0; --i) {
if ((k&1LL)==0LL) {
pos = (pos+po[i])%MOD;
}
k = (k+1LL)>>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... |