MathDB
Finding best possible values of grids

Source: IMOC 2021 C11

August 11, 2021
combinatoricsgridIMOC

Problem Statement

In an m×nm \times n grid, each square is either filled or not filled. For each square, its value is defined as 00 if it is filled and is defined as the number of neighbouring filled cells if it is not filled. Here, two squares are neighbouring if they share a common vertex or side. Let f(m,n)f(m,n) be the largest total value of squares in the grid. Determine the minimal real constant CC such that f(m,n)mnC\frac{f(m,n)}{mn} \le Cholds for any positive integers m,nm,n
CSJL