Proofs of Algorithm Correctness and Runtime Estimates · Guessing a Number

Lesson 8

Nikolai Chukhin · Alexander S. Kulikov

Programming problem. Implement a strategy that asks at most twelve questions and guesses \(0 \le x < 16\) assuming that at most one of the answers is wrong.

5 points
Public samples
Public sample 1
Input
(empty)
Expected output
1