RU-ALLRUSSIAN 2016 Problem 113
We have sheet of paper, divided on unit squares. In some squares we put rightangled isosceles triangles with leg = ( Every triangle lies in one unit square and is half of this square). Every unit grid segment( boundary too) is under one leg of triangle. Find maximal number of unit squares, that don`t contains triangles.
Dataset text AI-MO AoPS. 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.