蓝桥杯基础：回形取数python

没看过别人的，我感觉我这个turn_around（）函数还挺方便。
代码如下：

[m,n]=input().split()
m=int(m)
n=int(n)
origin=[[0 for i in range(n)] for i in range(m)]
for i in range(m):
    origin[i]=input().split()
    origin[i]=list(map(int,origin[i]))

def turn_around(a):
    m=len(a)
    n=len(a[0])
    for i in range(m):
        a[i]=a[i][1:]
    b=[[0 for i in range(m)]for i in range(n-1)]

    for i in range(n-1):
        for j in range(m):
            b[i][j]=a[m-j-1][i]
    return b

def main():
    global origin
    while(origin):
        m=len(origin)
        for i in range(m):
            print(origin[i][0],end=' ')
        origin=turn_around(origin)

if __name__ == '__main__':
    main()