AcWing 462. 扫雷游戏
原题链接
简单
作者:
王小强
,
2021-01-30 09:51:00
,
所有人可见
,
阅读 329
Enumeration (枚举)
#include <iostream>
using namespace std;
const int N = 110;
char g[N][N];
int m, n;
int main() {
cin >> m >> n;
for (int y = 0; y < m; ++y) cin >> g[y];
for (int y = 0; y < m; ++y) {
for (int x = 0; x < n; ++x) {
if (g[y][x] == '*') {
cout << '*';
continue;
}
int cnt = 0;
for (int r = max(0, y - 1); r < min(m, y + 2); ++r)
for (int c = max(0, x - 1); c < min(n, x + 2); ++c)
cnt += g[r][c] == '*';
g[y][x] = cnt + '0';
cout << g[y][x];
}
printf("\n");
}
return 0;
}