| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 572154 | bugmenot111 | Rack (eJOI19_rack) | Pypy 3 | 151 ms | 102400 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.
n, k = map(int, input().split())
m = 1<<(n-1)
a = [0]
while m > 0:
a += [x+m for x in a]
m //= 2
print(a[k-1]+1)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||