100*100 garden - Iran NMO 1999 (Second Round) Problem3
Source:
October 4, 2010
combinatorics proposedcombinatorics
Problem Statement
We have a garden and we’ve plant trees in the squares (exactly one in each.). Find the maximum number of trees that we can cut such that on the segment between each two cut trees, there exists at least one uncut tree.