Run ID 作者 问题 语言 测评结果 Time Memory 代码长度 提交时间
86631 汤弘毅 方阵填数 Python3 Accepted 37 MS 3836 KB 549 2024-07-27 09:15:18

Tests(3/3):


Code:

n = int(input()) x,y = 1,n ds = ((1,0),(0,-1),(-1,0),(0,1)) d = 0 m = [[0 for p in range(n)] for j in range(n)] for i in range(n): m[i].insert(0,'*') m[i].append('*') m.insert(0,["*" for i in range(n+2)]) m.append(["*" for i in range(n+2)]) for i in range(1,n*n+1): m[x][y] = i if m[x+ds[d][0]][y+ds[d][1]] != 0: if d == 3: d = 0 else: d = d+1 x,y = x+ds[d][0],y+ds[d][1] for i in range(1,n+1): for j in range(1,n+1): print(m[i][j],end = ' ') print()