Submission #4043786

---

Source Code Expand

def gcd(x, y):
    while y != 0:
        x, y = y, x % y
    return x

def lcm(x, y):
    return (x * y) // gcd(x, y)

n, m = map(int, input().split())
S = input()
T = input()

if S[:: n // gcd(n, m)] != T[:: m  // gcd(n, m)]:
    print(-1)
else:
    print(lcm(n, m))

Submission Info

Judge Result