Problem

Source:

Tags: combinatorics



Ana chose some unit squares of a $50 \times 50$ board and placed a chip on each of them. Prove that Beto can always choose at most $99$ empty unit squares and place a chip on each so that each row and each column of the board contains an even number of chips.