| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 71927 | 胡海峰老师 | 蛇形矩阵 | Python3 | Accepted | 35 MS | 3832 KB | 556 | 2024-04-27 23:16:42 |
n = int(input()) a = [[0]*n for _ in range(n)] x,y =0,0 dirs =[(1,0),(-1,0)] a[x][y] = i = 1 while i<n**2: # flag = False # if flag : # break for d in dirs: x,y=x+d[0],y+d[1] while 0<=x<n and 0<=y<n: i+=1 a[x][y] = i x,y = x+d[0],y+d[1] x,y = x-d[0],y-d[1] y += 1 i +=1 if y>=n: # flag = True break a[x][y]= i for row in a: for ele in row: print( str(ele).rjust(3),end='') print()