题解 | 扫雷

import sys

def solve():
    
    n, m = map(int, sys.stdin.readline().split())
    mat = [list(sys.stdin.readline().strip()) for _ in range(n)]
 
    d = [(-1, -1), (-1, 0), (-1, 1),
         (0, -1),           (0, 1),
         (1, -1), (1, 0), (1, 1)]

    for i in range(n):
        for j in range(m):
            if mat[i][j] == '*':
                print('*', end='')
            else:
                count = 0
                for dx, dy in d:
                    ni, nj = i + dx, j + dy
                    if 0 <= ni < n and 0 <= nj < m and mat[ni][nj] == '*':
                        count += 1
                print(count, end='')
        print()

solve()