题解 | #公共子串计算#

while True:
    try:
        s1,s2 = input(),input()
        a = len(s1)
        b = len(s2)
        list = [0]
        if a > b:
            s1,s2 = s2,s1#s1存短，s2存长
        #暴力
        for j in range(a):
            for i in range(j+1,a+1):
                if s1[j:i] in s2:
                    list.append(len(s1[j:i]))

        print(max(list))

    except:
        break