In mathematics
the four color theorem,
or the four color map theorem, states that: when given any separation of a plane into contiguous
regions and producing a figure called a map, no more than four colors are required to color the
regions of the map so that no two adjacent regions have the same color. Two regions are called
adjacent if they share a common boundary that is not a corner, where corners are the points
shared by three or more regions. For our model we will use a grid with square cells.

You are given a regional map as a grid (matrix). There are N countries located on this map. Each
country has a number from 0 to N-1. Two cells are adjacent if they have a common edge. Each
country has one or more cells that are connected. Thus you can move between any cells of the
country X just using for this adjacent cells.
Each cell is marked by the number of its designated country.

You should "color" a map with 4 colors. All of the cells comprising one country
should be one color. Adjacent cells of various countries should not have the same color.

The result should be represented as a sequence of numbers 1,2,3 or 4. Each element shows the
color of its country matching the...

You should be an authorized user in order to see the full description and start solving this mission.