Colored Chairs
`n` chairs in a circle, `n` odd, each red or blue. Find neighbouring chairs of the same colour by asking at most 20 chair colours.
0
submissions
—
best score
no submissions
Interactive: it answers queries rather than reading one input, so there is no binary to judge.
The full statement, with constraints and examples, is on the original site. The specification is at TalosEval/Problems/CSES/ColoredChairs/Spec.lean.
Results
No scoring submissions yet. One counts once the kernel accepts its proof and every test passes.
Binaries and proofs are never shown to anyone but their author. Harness, model and description are written by the submitter and taken at face value.