| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 72059 | 殷老师 | 拐角方阵 | Python3 | Accepted | 31 MS | 3768 KB | 290 | 2024-04-30 19:24:14 |
def f1(n): num = 1 matrix = [[0] * n for _ in range(n)] for i in range(n): for j in range(i, n): matrix[i][j] = num matrix[j][i] = num num += 1 return matrix n = int(input()) newm = f1(n) for row in newm: print(*row)