France TST 2000 D2Q1
Source:
March 2, 2013
combinatorics unsolvedcombinatorics
Problem Statement
Some squares of a board are occupied with pawns. Find the smallest number of pawns for which it is possible that for each empty square, the total number of pawns in the row or column of that square is at least .