MathDB
2019 Junior Balkan MO, Problem 4

Source: 2019 Junior Balkan MO

June 22, 2019
combinatoricsJuniorBalkanJBMO2019

Problem Statement

A 5×1005 \times 100 table is divided into 500500 unit square cells, where nn of them are coloured black and the rest are coloured white. Two unit square cells are called adjacent if they share a common side. Each of the unit square cells has at most two adjacent black unit square cells. Find the largest possible value of nn.