题解 | 扫雷

#include <ios>
#include <iostream>
using namespace std;

int main() {
    int n, m, sum, i = 0, j = 0;
    char c;
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> m;
    int lei[1001][1001] = {0};
    sum = n * m;
    while (sum) {
        if (j == m) {
            j = 0;
            i++;
            continue;
        }
        cin >> c;
        if (c == '*') {
            if (i != 0) {
                lei[i - 1][j]++;
                if (j != 0) {
                    lei[i - 1][j - 1]++;
                }
                if (j != m) {
                    lei[i - 1][j + 1]++;
                }
            }
            if (i != n) {
                lei[i + 1][j]++;
                if (j != 0) {
                    lei[i + 1][j - 1]++;
                }
                if (j != m) {
                    lei[i + 1][j + 1]++;
                }
            }
            if (j != 0) {
                lei[i][j - 1]++;
            }
            if (j != m) {
                lei[i][j + 1]++;
            }
            lei[i][j] = 10;
        }
        /*cout << c<< " "<<i<<" "<<j<<endl;
        for (int c = 0; c < n; c++) {
            for (int d = 0; d < m; d++) {
                cout << lei[c][d];
                if (d < m - 1) {
                    cout << " ";
                }
            }
            cout << endl;
        }*/
        j++;
        sum--;
    }
    for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) {
            if (lei[i][j] >= 10) {
                cout << "*";
            } else {
                cout << lei[i][j];
            }
        }
        cout << endl;
    }
}
// 64 位输出请用 printf("%lld")