题解 | #查找两个字符串a,b中的最长公共子串#

while True:
    try:
        s1, s2 = input(), input()
    except:
        break
    if len(s1) > len(s2):  # s1短 s2长
        s1, s2 = s2, s1
    M = 0
    result = []
    for i in range(len(s1)):
        for j in range(i, len(s1)):
            if s1[i:j + 1] in s2 and j + 1 - i > M:
                M = j + 1 - i
                result = s1[i:j+1]
    print(result)