Submission #1605289


Source Code Expand

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = float("inf")


def main():
    N = int(input())
    s = input()
    t = input()

    for i in range(N, 0, -1):
        if s[-i:] == t[:i]:
            print(2 * N - i)
            break
    else:
        print(2 * N)


if __name__ == '__main__':
    main()

Submission Info

Submission Time
Task A - Prefix and Suffix
User MitI_7
Language Python (3.4.3)
Score 200
Code Size 514 Byte
Status AC
Exec Time 21 ms
Memory 3316 KB

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 20 ms 3316 KB
0_01.txt AC 20 ms 3316 KB
0_02.txt AC 21 ms 3316 KB
1_00.txt AC 21 ms 3316 KB
1_01.txt AC 21 ms 3316 KB
1_02.txt AC 20 ms 3316 KB
1_03.txt AC 20 ms 3316 KB
1_04.txt AC 20 ms 3316 KB
1_05.txt AC 21 ms 3316 KB