Question 132
$k$ rooks are placed on the $10 \times 10$ board. All the squares beaten by at least one rook are marked (a rook in particular beats its own square). It occurs that after removing any rook from the board, at least one marked square becomes not beaten. Find the greatest possible value of $k$. (S. Berlov)