| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 134783 | 叶航帅 | 矩阵对角线 | Python3 | Accepted | 80 MS | 4676 KB | 361 | 2025-11-01 14:49:46 |
n,m = input().split() n = int(n) m = int(m) a = [] for i in range(n): b = input().split() b = [int(x) for x in b] a.append(b) for x in range(n): for y in range(n): if x == y or x+y==n-1: a[x][y]+=m for i in range(len(a)): for j in range(len(a)): print("{:>5}".format(a[i][j]) , end='') print()