题解 | #公共子串计算#

while 1:
    try:
        short_s, long_s = input(), input()
        if len(short_s) > len(long_s):
            short_s, long_s = long_s, short_s
        
        counter = [0]

        for i in range(len(short_s)):
            for j in range(len(short_s), i, -1):
                test_s = short_s[i:j]
                if test_s in long_s:
                    counter.append(j - i)

        print(max(counter))

    except:
        break