# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
414489 | 2021-05-30T13:25:52 Z | aris12345678 | Rack (eJOI19_rack) | C++14 | 9 ms | 8120 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 8012 KB | Output is correct |
2 | Correct | 9 ms | 8012 KB | Output is correct |
3 | Correct | 9 ms | 8012 KB | Output is correct |
4 | Correct | 9 ms | 8120 KB | Output is correct |
5 | Correct | 9 ms | 8012 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 8012 KB | Output is correct |
2 | Correct | 9 ms | 8012 KB | Output is correct |
3 | Correct | 9 ms | 8012 KB | Output is correct |
4 | Correct | 9 ms | 8120 KB | Output is correct |
5 | Correct | 9 ms | 8012 KB | Output is correct |
6 | Correct | 9 ms | 8012 KB | Output is correct |
7 | Correct | 9 ms | 8012 KB | Output is correct |
8 | Correct | 8 ms | 8112 KB | Output is correct |
9 | Correct | 9 ms | 8012 KB | Output is correct |
10 | Correct | 9 ms | 8012 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 8012 KB | Output is correct |
2 | Correct | 9 ms | 8012 KB | Output is correct |
3 | Correct | 9 ms | 8012 KB | Output is correct |
4 | Correct | 9 ms | 8120 KB | Output is correct |
5 | Correct | 9 ms | 8012 KB | Output is correct |
6 | Correct | 9 ms | 8012 KB | Output is correct |
7 | Correct | 9 ms | 8012 KB | Output is correct |
8 | Correct | 8 ms | 8112 KB | Output is correct |
9 | Correct | 9 ms | 8012 KB | Output is correct |
10 | Correct | 9 ms | 8012 KB | Output is correct |
11 | Correct | 9 ms | 8104 KB | Output is correct |
12 | Correct | 8 ms | 8072 KB | Output is correct |
13 | Correct | 8 ms | 8012 KB | Output is correct |
14 | Correct | 9 ms | 8108 KB | Output is correct |
15 | Correct | 9 ms | 8112 KB | Output is correct |