10pts,求调，玄关。

![测试点]```cpp #include <bits/stdc++.h> using namespace std;

/天空属于哈夫克/ int main() { long long n, m; cin >> n >> m; string a[n + 1][m + 1]; for (long long i = 1; i <= n; i++) { for (long long j = 1; j <= m; j++) { cin >> a[i][j]; } } string b[n][m]; for (long long i = 1; i <= n; i++) { for (long long j = 1; j <= m; j++) { if (a[i][j] == "") { b[i - 1][j - 1] = ''; continue; } string cnt = 0; if (a[i][j - 1] == "") { long long t = stoi(cnt); t++; cnt = to_string(t); } else if (a[i][j + 1] == "") { long long t = stoi(cnt); t++; cnt = to_string(t); } else if (a[i - 1][j] == "") { long long t = stoi(cnt); t++; cnt = to_string(t); } else if (a[i + 1][j] == "") { long long t = stoi(cnt); t++; cnt = to_string(t); } else if (a[i + 1][j + 1] == "") { int t = stoi(cnt); t++; cnt = to_string(t); } else if (a[i + 1][j - 1] == "") { long long t = stoi(cnt); t++; cnt = to_string(t); } else if (a[i - 1][j + 1] == "") { long long t = stoi(cnt); t++; cnt = to_string(t); } else if (a[i - 1][j - 1] == "") { long long t = stoi(cnt); t++; cnt = to_string(t); } b[i - 1][j - 1] = cnt; } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cout << b[i][j]; } }

return 0;

}

(file:///D:/HuaweiMoveData/Users/lsxx/Desktop/%E5%B1%80%E9%83%A8%E6%88%AA%E5%8F%96_20251124_202419.png)