JMO 1999 Problem 1
One can place a stone on each of the squares of a board. Find the minimum number of stones that must be placed so that, for any blank square on the board, the total number of stones placed in the corresponding row and column is at least .
Dataset text AoPS wiki problems. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.