Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
128202 | 胡皓宇 | 拐角方阵 | Python3 | Accepted | 54 MS | 3764 KB | 256 | 2025-08-10 09:03:23 |
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 x in range(n): for y in range(n): print(a[x][y],end=" ") print()