# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1075796 | matthew | Rack (eJOI19_rack) | C++17 | 1 ms | 604 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 <stdio.h>
#include <algorithm>
const int MOD = 1'000'000'007;
int lgput(int a, int b) {
int res = 1;
while(b > 0) {
if(b & 1) {
res = (res * (long long)a) % MOD;
}
a = (a * (long long)a) % MOD;
b /= 2;
}
return res;
}
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int n, i, res;
long long k;
scanf("%d%lld", &n, &k);
k--;
res = 0;
for(i = 0; i < std::min(n, 61); i++) {
if((k >> i) & 1) {
res = (res + lgput(2, n - 1 - i)) % MOD;
}
}
printf("%d\n", (res + 1) % MOD);
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... |