2004 OIM Problems/Problem 1

Revision as of 16:24, 14 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == Squares on a <math>1001 \times 1001</math> board must be colored according to the following rules: * If two squares have a common side, then at least one of the...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Squares on a $1001 \times 1001$ board must be colored according to the following rules:

  • If two squares have a common side, then at least one of them must be colored.
  • For every six consecutive cells in a row or column, at least two of them that are adjacent must always be colored

Find the minimum number of squares that must be colored.

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

OIM Problems and Solutions