IMO Shortlist 2014 problem C3
Kvaliteta:
Avg: 0,0Težina:
Avg: 7,5Let be an integer. Consider an
chessboard divided into
unit squares. We call a configutaion of
rooks on this board happy if every row and every column contains exactly one rook. Find the gretest positive integer
such that for every happy configuration of rooks, we can find a
square without a rook on any of its
unit squares.
(Croatia)
Izvor: https://www.imo-official.org/problems/IMO2014SL.pdf