Submission #3423017

Source Code Expand

from fractions import gcd
import sys
N,M=map(int,input().split())
S=input()
T=input()
a=gcd(M,N)
m=M//a
n=N//a
for i in range(a):
    if S[n*i]!=T[m*i]:
        print(-1)
        sys.exit()
print(m*N)

Submission Info

Submission Time
Task A - Two Abbreviations
User okumura
Language Python (3.4.3)
Score 300
Code Size 212 Byte
Status AC
Exec Time 54 ms
Memory 5688 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 21
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All sample-01.txt, sample-02.txt, sample-03.txt, sample-01.txt, sample-02.txt, sample-03.txt, subtask01-01.txt, subtask01-02.txt, subtask01-03.txt, subtask01-04.txt, subtask01-05.txt, subtask01-06.txt, subtask01-07.txt, subtask01-08.txt, subtask01-09.txt, subtask01-10.txt, subtask01-11.txt, subtask01-12.txt, subtask01-13.txt, subtask01-14.txt, subtask01-15.txt
Case Name Status Exec Time Memory
sample-01.txt AC 54 ms 5688 KiB
sample-02.txt AC 35 ms 5048 KiB
sample-03.txt AC 34 ms 5048 KiB
subtask01-01.txt AC 35 ms 5048 KiB
subtask01-02.txt AC 35 ms 5304 KiB
subtask01-03.txt AC 35 ms 5432 KiB
subtask01-04.txt AC 35 ms 5432 KiB
subtask01-05.txt AC 35 ms 5432 KiB
subtask01-06.txt AC 35 ms 5432 KiB
subtask01-07.txt AC 35 ms 5176 KiB
subtask01-08.txt AC 36 ms 5304 KiB
subtask01-09.txt AC 35 ms 5304 KiB
subtask01-10.txt AC 35 ms 5432 KiB
subtask01-11.txt AC 35 ms 5432 KiB
subtask01-12.txt AC 35 ms 5304 KiB
subtask01-13.txt AC 35 ms 5304 KiB
subtask01-14.txt AC 35 ms 5304 KiB
subtask01-15.txt AC 36 ms 5304 KiB