olymmath

RU-SPB 2021 Problem 112

  • Grade 11

The cells of a 100×100100 \times 100 table are colored white. In one move, it is allowed to select some 9999 cells from the same row or column and recolor each of them with the opposite color. What is the smallest number of moves needed to get a table with a chessboard coloring?

S. Berlov

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.

Add a solution

Similar problems

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

Locator ru-spb/2021/p112 · Tag AG06JRGHAK · Edit this page on GitHub · Keys: j next, k previous