2887: 变幻的矩阵

解题思路:

注意事项:

参考代码:

n= int(input())

m = [list(map(str,input().split())) for _ in range(n)]

cm = [list(map(str,input().split())) for _ in range(n)]

def ma1(tm):

    ma1 = []

    for i in range(n):

        t = []

        for j in range(n)[::-1]:

            t.append(tm[j][i])

        ma1.append(t)

    return ma1

def ma2(tm):

    ma2 = []

    for i in range(n)[::-1]:

        t = []

        for j in range(n):

            t.append(tm[j][i])

        ma2.append(t)

    return ma2  

def ma3(tm):

    ma3 = []

    for i in range(n):

        t = []

        for j in range(n):

            si = n-1-i

            sj = n-1-j

            t.append(tm[si][sj])

        ma3.append(t)

    return ma3

def ma4(tm):

    ma4 = []

    for i in range(n):

        t = []

        for j in range(n):

            t.append(tm[i][j])

        ma4.append(t)

    return ma4

def issame(pm,tm):

    for i in range(n):

        for j in range(n):

            if pm[i][j] != tm[i][j]:

                return False

    return True

if issame(ma1(m),cm):

    print(1)

elif issame(ma2(m),cm):

    print(2)

elif issame(ma3(m),cm):

    print(3)

elif issame(ma4(m),cm):

    print(4)

else:

    print(5)