UVa 10189 - Minesweeper

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. Well, 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 you how many mines there are adjacent to that square. For instance, supose the following 4x4 field with 2 mines (which are represented by an * character):

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

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

*100
2210
1*10
1110

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

The Input

The input will consist of an arbitrary number of fields. The first line of each field contains two integers n and m (0 < n,m <= 100) 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 is represented by an "." character (without the quotes) and each mine square is represented by an "*" character (also without the quotes). The first field line where n = m = 0 represents the end of input and should not be 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 the field (starting from 1). The next n lines should contain the field with the "." characters replaced by the number of adjacent mines to that square. There must be an empty line between field outputs.

Analysis

This problem is quite straigtforward. The problem size is small enough for me to simply store the whole field in char array. Then, I just need to look for all the mines in the field and update their surrounding hint numbers by +1.

Okay, just read the simple code below and you will know it.

// 10189 - Minesweeper
#include <iostream>

using namespace std;

int main()
{
	int n; // number of lines
	int m; // number of columns
	int num = 1; // number of field
	char field[110][110]; // 0 < n,m <= 100

	while( cin >> n >> m )
	{
		if( n==0 && m==0 ) break;

		// input and initialize
		for( int i=0; i<n; i++ )
		{
			cin >> field[i];
			for( int j=0; j<m; j++ )
			{
				if( field[i][j] == '.' )
					field[i][j] = '0'; // set all hint number to 0
			}
		}

		for( int i=0; i<n; i++ )
		{
			for( int j=0; j<m; j++ )
			{
				if( field[i][j] == '*' ) // update the hint numbers around the mine
				{
					for( int y=i-1; y<=i+1; y++ )
					{
						if( y<0 ) continue; // this row does not exist
						if( y>=n ) break; // this row does not exist

						for( int x=j-1; x<=j+1; x++ )
						{
							if( x<0 || field[y][x]=='*' ) continue; // jump to next column
							if( x>=m ) break; // jump to next row

							field[y][x]++; // update the hint number
						}
					}
				}
			}
		}

		if( num != 1 ) cout << endl;
		cout << "Field #" << num << ":" << endl;
		for( int i=0; i<n; i++ )
		{
			cout << field[i] << endl;
		}

		num++;
	}
	return 0;
}