啊？

#include <iostream>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    char a[105][105];
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> a[i][j];
        }
    }

    // 计算地雷格周围非地雷格的数量
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (a[i][j] == '*') {
                for (int k = 0; k < 8; k++) {
                    int ni = i + dirs[k][0], nj = j + dirs[k][1];
                    if (ni >= 1 && ni <= n && nj >= 1 && nj <= m && a[ni][nj] == '?') {
                        a[ni][nj] -= '0';
                    }
                }
            }
        }
    }

    // 输出结果
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cout << (a[i][j] < '0' ? a[i][j] + '0' : a[i][j]);
        }
        cout << endl;
    }

    return 0;
}

// 定义邻接格子的偏移量
const int dirs[8][2] = {{-1, -1}, {-1, 0},  {-1, 1}, {0, -1},
                         {0, 1},   {1, -1}, {1, 0},  {1, 1}};