# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1220566 | durdona | Rack (eJOI19_rack) | Pypy 3 | 157 ms | 48712 KiB |
mod = 10**9 + 7
def solve(n, k):
for i in range(n):
if k % 2 == 0:
k = k // 2
k = (k + pow(2, i, mod)) % mod
else:
k = k // 2 + 1
return 1
n, k = map(int, input().split())
print(solve(n, k))
Compilation message (stdout)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |