| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1278090 | eradax | Colors (BOI20_colors) | Pypy 3 | 221 ms | 51268 KiB | 
#!/usr/bin/env python3
from math import log2, ceil
def query(a):
	print(a, flush=True)
	res = int(input())
	return res
n = int(input())
lo = 0
hi = n
i = ceil(log2(n))
while lo + 1 < hi:
	mi = (lo + hi) // 2
	query(i)
	if (query(i + mi)):
		hi = mi
	else:
		lo = mi
	i -= 1
print(hi)
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... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
