OJ Board

Code: Select all

/*
@JUDGE_ID:  47559CM 10189 C++ ""
*/

#include <iostream>
using namespace std;

/* constants */
const char BOMB = '*';
const char BLANK = '.';

/* typedefs */
typedef struct {
	int N;
	int M;
	char grid[10][10];
} field;

/* prototypes */
void showBoard(field, int);

//===================================================================
int main(void) {
	int i,j, p, q;				// loop counters
	int fieldCount = 0; 		// number of 'fields' entered
	field boards[5];
	int N, M;				// N = rows down,M = columns down
	// get the dimensions
	cin >> N >> M;
	while (N!=0 && M!=0) {
		boards[fieldCount].N=N;
		boards[fieldCount].M=M;
		// enter the board
		for (i=0;i<N;i++) {
			for (j=0;j<M;j++) {
				cin >> boards[fieldCount].grid[i][j];
				if (boards[fieldCount].grid[i][j] == BLANK) {
					boards[fieldCount].grid[i][j] = '0';
				}
			}
		}
		// parse the board and generate the hints
		for (i=0;i<N;i++) {
			for (j=0;j<M;j++) {
				if (boards[fieldCount].grid[i][j] == BOMB) {
					// traverse the surrounding squares and update
					for (p=i-1; p<=i+1; p++) {
						for (q=j-1; q<=j+1; q++) {
							if (boards[fieldCount].grid[p][q] != BOMB) {
								// increment the number of hints
								if ((p>=0) && (p<=N) && (q>=0) && (q<=M)) {
									boards[fieldCount].grid[p][q]++;
								}
							}
						}
					}
				}
			}
		};
		//showBoard(board,N,M, fieldCount);
		cin >> N >> M;
		fieldCount++;
	}

	// print out the fields
	for (p=0;p<fieldCount;p++) {
		showBoard(boards[p],p);
	}
	return 0;
}
//===================================================================

void showBoard(field b, int fc) {
	// display grid of n x m to stdout
	int i,j;				// loop coounters
	cout << endl << "Field #" << fc+1 << ": " << endl;
	for (i=0;i<b.N;i++) {
		for (j=0;j<b.M;j++) {
			cout << b.grid[i][j];
			if ((j+1) % b.M == 0) {
				cout << endl;
			}
		}
	}
	//cout << endl;
 }

Code: Select all

.....
.   .
.   .
.   .
.....