UVa 10189 Minesweeper (analog)

10189-minesweeper

Time limit:3.000 seconds

Http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem &problem=1130

The Problem

Have you ever played minesweeper? It ' s a cute little game which comes within a certain operating System which name we can ' t really remember. So, the goal of the game is to find where are all the mines within a MxN field. To help you, the game shows a number in a square which tells your how many mines there are adjacent to that square. For instance, supose of the following 4x4 field with 2 mines (which are represented from an * character):

*...
....
. *..
....

If we represent the same field placing the hint numbers described above, we would end up with:

*100
2210
1*10
1110

As you could have already noticed, each square could have at most 8 adjacent squares.

The Input

The input would consist of an arbitrary number of fields. The "a" of each field contains two integers n and m (0 < N,m <=) which stands for the number of lines and Columns of the field respectively. The next n lines contains exactly m characters and represent the field. Each safe square are represented by a "character" (without the quotes) and each mine square are represented by a "*" Cha Racter (also without the quotes). The "the" field line where n = m = 0 represents the "end of" and should not is processed.

The Output

For each field, you must print the following message in a line alone:

Field #x:

Where x stands for the "Number of" field (starting from 1). The next n lines should contain the field with the '. ' characters replaced by the # of adjacent mines to that square. There must be a empty line between field outputs.

Sample Input

4 4
* ...
....
. *..
....
3 5
* *
... .....
. *...
0 0

Sample Output

Field #1:
*100
2210
1*10
1110

field #2:
**100
33200 1*100