| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 128201 | 胡皓宇 | 拐角方阵 | Python3 | Wrong Answer | 61 MS | 3768 KB | 225 | 2025-08-10 09:00:04 |
n = int(input()) a = [] for i in range(n): b = [0 for x in range(n)] a.append(b) for x in range(n): for y in range(n): a[x][y] = min(x,y)+1 for i in range(n): print(a[i],end=" ") print()
------Input------
5
------Answer-----
1 1 1 1 1 1 2 2 2 2 1 2 3 3 3 1 2 3 4 4 1 2 3 4 5
------Your output-----
[1, 1, 1, 1, 1] [1, 2, 2, 2, 2] [1, 2, 3, 3, 3] [1, 2, 3, 4, 4] [1, 2, 3, 4, 5]