Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
71364 | 胡海峰老师 | 数字方阵 | Python3 | Accepted | 34 MS | 3784 KB | 470 | 2024-04-23 10:16:01 |
n = int(input()) a = [[0]*n for x in range(n)] nums =[ (i,n-1-i) for i in range(n//2+1)] if n%2 \ else [ (i,n-1-i) for i in range(n//2)] # for i in range(n//2+1): # j = n-1-i # nums.append((i,j)) # print(nums) for i in range(n): for j in range(n): for t,ij in enumerate(nums): if i==ij[0] or i == ij[1] or j==ij[0] or j == ij[1]: a[i][j] = t+1 break for row in a: print(*row)