扫雷（蓝桥杯-Python）

 

 

import os
import sys

# 请在此输入您的代码
# 接收数据
n, m = input().split()
n = int(n)
m = int(m)
arr = [[] for i in range(n)]
for i in range(n):
    arr[i] = list(map(int, input().split()))

# 最后结果
brr = [[0 for j in range(m)] for i in range(n)]

# 八个方向,八个元组，组成一个列表
d = [(1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0), (-1, 1), (0, 1)]
# 枚举每个点
for i in range(n):
    for j in range(m):
        if arr[i][j] == 1:
            brr[i][j] = 9
        else:
            brr[i][j] = 0
            # 枚举8个方向
            for k in range(8):
                x, y = i+d[k][0], j+d[k][1]
                # 保证不出界
                if 0 <= x < n and 0 <= y < m:
                    # 采用两个列表使得结果不互相干扰
                    brr[i][j] += arr[x][y]

for i in range(n):
    for j in range(m):
        print(brr[i][j], end=' ')
    print()