IMO 2014 problem 2

  Avg: 0.0
  Avg: 6.0
Dodao/la: arhiva
Sept. 21, 2014
Let n \geq 2 be an integer. Consider an n \times n chessboard consisting of n^2 unit squares. A configuration of n rooks on this board is peaceful if every row and every column contains exactly one rook. Find the greatest positive integer k such that, for each peaceful configuration of n rooks, there is a k \times k square which does not contain a rook on any of its k^2 unit squares.
Source: International Mathematical Olympiad 2014, day 1