Run ID 作者 问题 语言 测评结果 Time Memory 代码长度 提交时间
71822 图形化自测 方阵填数 Python3 Accepted 36 MS 3844 KB 581 2024-04-27 17:16:07

Tests(3/3):


Code:

n = int(input()) x, y = -1, n - 1 dir = [[1, 0], [0, -1], [-1, 0], [0, 1]] a = [[0 for i in range(n + 5)] for j in range(n + 5)] vis = [[0 for i in range(n + 5)] for j in range(n + 5)] f = 0 for i in range(1, n * n + 1): xx = x + dir[f][0] yy = y + dir[f][1] if xx < 0 or xx > n - 1 or yy < 0 or yy > n - 1 or vis[xx][yy] == 1: f = (f + 1) % 4 xx = x + dir[f][0] yy = y + dir[f][1] x = xx y = yy a[x][y] = i vis[x][y] = 1 for i in range(n): for j in range(n): print(a[i][j], end = " ") print()