| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 | 
|---|---|---|---|---|---|---|---|---|
| 135490 | 叶航帅 | 矩阵加法 | Python3 | Accepted | 61 MS | 4248 KB | 395 | 2025-11-03 21:19:26 | 
n, m = map(int, input().split()) a = [] for e in range(n): row = list(map(int, input().split())) a.append(row) b = [] for e in range(n): row = list(map(int, input().split())) b.append(row) c = [] for i in range(n): row = [] for j in range(m): row.append(a[i][j] + b[i][j]) c.append(row) for row in c: print(' '.join(map(str, row)))