Minesweeper
Image: minesweeper
Have you ever played Minesweeper? This cute little game comes with a certain operating system whose name we can't remember. The goal of the game is to find where all the mines are located within a M x N field.
The game shows a number in a square which tells you how many mines there are adjacent to that square. Each square has at most eight adjacent squares. The 4 x 4 field on the left contains two mines, each represented by a "*'' character.
InputThe first line contains two integers n and m (0 < n, m <= 100) which stand for the number of lines and columns of the field, respectively. Each of the next n lines contains exactly m characters, representing the field.
Safe squares are denoted by ".'' and mine squares by "*'', both without the quotes.
Safe squares are denoted by ".'' and mine squares by "*'', both without the quotes.
Output
The output should contain the field with the ".'' characters replaced by the number of mines adjacent to that square.
The output should contain the field with the ".'' characters replaced by the number of mines adjacent to that square.
4 4
*...
....
.*..
....
*100
2210
1*10
1110
Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.