Y by Adventure10, lian_the_noob12, wizixez
An
square table is divided into
unit cells. Some unit segments of the obtained grid (i.e. the side of any unit cell) is colored black so that any unit cell of the given square has exactly one black side. Find
a) the smallest
b) the greatest possible number of black unit segments.


a) the smallest
b) the greatest possible number of black unit segments.