# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1229177 | 1zaid1 | Rack (eJOI19_rack) | Pypy 3 | 175 ms | 125072 KiB |
M = 1000000007
p = [1]
for i in range(1000000):
p.append((2*p[-1])%M)
def f(n, x):
if (n == 1):
return x
if x%2 == 1:
return f(n//2, (x+1)//2)
else:
return (p[n] + f(n//2, x//2))%M
k, x = input().split(' ')
x = int(x)
k = int(k)
print(f(pow(2, k-1), x))
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... |