MathDB

We have a

m\times n

table and

m\geq{4}

and we call a

1\times 1

square a room. When we put an alligator coin in a room, it menaces all the rooms in his column and his adjacent rooms in his row. What's the minimum number of alligator coins required, such that each room is menaced at least by one alligator coin? (Notice that all alligator coins are vertical.)

Problem Statement