| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 72040 | 蒙恒羽 | 拐角方阵 | Python3 | Accepted | 31 MS | 3772 KB | 366 | 2024-04-29 22:31:34 |
n = int(input()) a = [ [0]*n for x in range(n) ] for i in range(n): for j in range(n): if i==j: a[i][j] = i+1 for jj in range(j+1,n):#向右发射 a[i][jj] = i+1 for ii in range(i + 1, n):#向下发射 a[ii][j] = i + 1 for row in a: print(*row)