olymmath

RU-SPB 2016 Problem 92

  • Grade 9

On a 300×300300 \times 300 board, several rooks are placed that beat the entire board. Within this case, each rook beats no more than one other rook. At what least kk , it is possible to state that there is at least one rook in each k×kk\times k square ?

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.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator ru-spb/2016/p92 · Tag NWAWF6M884 · Edit this page on GitHub · Keys: j next, k previous