백준 4108번 지뢰찾기 C++

https://www.acmicpc.net/problem/4108

4108번: 지뢰찾기

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long;

int dRow[8] = { -1,-1, 0, 1, 1, 1, 0,-1 };
int dCol[8] = {  0, 1, 1, 1, 0,-1,-1,-1 };

vector<vector<char>> board;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int r, c;
	while (true) {
		cin >> r >> c;
		if (r == 0 && c == 0) break;
		board = vector<vector<char>>(r, vector<char>(c));
		for (int i = 0; i < r; i++) {
			for (int j = 0; j < c; j++) {
				cin >> board[i][j];
			}
		}
		for (int i = 0; i < r; i++) {
			for (int j = 0; j < c; j++) {
				if (board[i][j] == '*') continue;
				int cnt = 0;
				for (int k = 0; k < 8; k++) {
					int nextRow = i + dRow[k];
					int nextCol = j + dCol[k];
					if (nextRow < 0 || nextRow >= r) continue;
					if (nextCol < 0 || nextCol >= c) continue;
					if (board[nextRow][nextCol] != '*') continue;
					cnt++;
				}
				board[i][j] = cnt + 48;
			}
		}
		for (int i = 0; i < r; i++) {
			for (int j = 0; j < c; j++) {
				cout << board[i][j];
			}
			cout << "\n";
		}
	}
};