Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
86996 | 汤弘毅 | 数字方阵 | Python3 | Accepted | 36 MS | 3800 KB | 294 | 2024-07-31 21:26:13 |
n = int(input()) s = [[0]*n for x in range(n)] c = n/2 if c == int(c): c = int(c) else: c = int(c)+1 for i in range(c): for j in range(i,n-i): for k in range(i,n-i): s[j][k] = i+1 for i in s: for j in i: print(j,end = ' ') print()