MathDB
Problems
Contests
National and Regional Contests
Serbia Contests
Serbia JBMO TST
2016 Junior Balkan Team Selection Test
3
3
Part of
2016 Junior Balkan Team Selection Test
Problems
(1)
Serbia Junior TST 2016
Source: Serbia Junior TST 2016 P3
5/21/2016
In two neigbouring cells(dimensions
1
×
1
1\times 1
1
×
1
) of square table
10
×
10
10\times 10
10
×
10
there is hidden treasure. John needs to guess these cells. In one
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
i
t
a
l
i
c
′
>
m
o
v
e
<
/
s
p
a
n
>
<span class='latex-italic'>move</span>
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
i
t
a
l
i
c
′
>
m
o
v
e
<
/
s
p
an
>
he can choose some cell of the table and can get information whether there is treasure in it or not. Determine minimal number of
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
i
t
a
l
i
c
′
>
m
o
v
e
<
/
s
p
a
n
>
<span class='latex-italic'>move</span>
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
i
t
a
l
i
c
′
>
m
o
v
e
<
/
s
p
an
>
's, with properly strategy, that always allows John to find cells in which is treasure hidden.
combinatorics