提出 #65443861

---

ソースコード 拡げる

n = int(input())
s = [list(input()) for _ in range(n)]
t = [list(input()) for _ in range(n)]


def rotate(s):
    sr = []
    for i in range(n):
        tmp = []
        for j in range(n):
            tmp.append(s[n - j - 1][i])
        sr.append(tmp)
    return sr


def calc(s, t):
    cost = 0
    for i in range(n):
        for j in range(n):
            if s[i][j] != t[i][j]:
                cost += 1
    return cost


s1 = rotate(s)
s2 = rotate(s1)
s3 = rotate(s2)

ans = min([calc(s, t), 1 + calc(s1, t), 2 + calc(s2, t), 3 + calc(s3, t)])
print(ans)

提出情報

ジャッジ結果