Submission #956357

Source Code Expand

N = int(input())
s = input()
t = input()
mx = 0
for i in range(0,N):
    cnt = 0
    for j in range(0,N):
        if i+j >= N: break
        if s[i+j] == t[j]:
            cnt += 1
    mx = max(mx,cnt)
print(len(s+t[mx:]))

Submission Info

Submission Time
Task A - Prefix and Suffix
User blue9
Language Python (3.4.3)
Score 200
Code Size 235 Byte
Status AC
Exec Time 24 ms
Memory 3064 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 9
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt
Case Name Status Exec Time Memory
0_00.txt AC 22 ms 3064 KiB
0_01.txt AC 22 ms 3064 KiB
0_02.txt AC 22 ms 3064 KiB
1_00.txt AC 22 ms 3064 KiB
1_01.txt AC 24 ms 3064 KiB
1_02.txt AC 24 ms 3064 KiB
1_03.txt AC 23 ms 3064 KiB
1_04.txt AC 23 ms 3064 KiB
1_05.txt AC 23 ms 3064 KiB