2897: 神奇的幻方

解题思路:

注意事项:

参考代码:

n = int(input())

a = 1

n = 2*n -1

l = [[0 for j in range(n)] for i in range(n)]

row = 0

col = n//2

l[0][col] = 1

while a < n*n:

    a += 1

    if 0 <= (row-1) <= n-1 and 0<= (col+1) <= n-1 and l[row-1][col+1] == 0:

        row -= 1

        col += 1

        l[row][col] = a

    elif 0 <= (row-1) <= n-1 and 0<= (col+1) <= n-1 and l[row-1][col+1] != 0:

        row += 1

        l[row][col] = a

    elif row == 0 and col == n-1:

        row += 1

        l[row][col] = a

    elif row == 0:

        row = n-1

        col += 1 

        l[row][col] = a 

    elif col == n-1:

        row -= 1 

        col = 0

        l[row][col] = a

for i in l:

    print(*i)