| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 71780 | 图形化自测 | 拐角方阵 | Python3 | Accepted | 35 MS | 3784 KB | 360 | 2024-04-27 16:44:47 |
n = int(input()) a = [] for i in range(n): b = [] for j in range(n): b.append(0) a.append(b) for i in range(n): for j in range(i, n): a[i][j] = i + 1 for j in range(n): for i in range(j + 1, n): a[i][j] = j + 1 for i in range(n): for j in range(n): print(a[i][j], end = " ") print()