MathDB
Serbia Junior TST 2016

Source: Serbia Junior TST 2016 P3

May 21, 2016
combinatorics

Problem Statement

In two neigbouring cells(dimensions 1×11\times 1) of square table 10×1010\times 10 there is hidden treasure. John needs to guess these cells. In one <spanclass=′latex−italic′>move</span><span class='latex-italic'>move</span> he can choose some cell of the table and can get information whether there is treasure in it or not. Determine minimal number of <spanclass=′latex−italic′>move</span><span class='latex-italic'>move</span>'s, with properly strategy, that always allows John to find cells in which is treasure hidden.
Back to ProblemsView on AoPS