题解 | 公共子串计算

import sys
while True:
    try:
        s = input()
        t = input()
        if len(s) > len(t):
            s,t = t,s
        max_len = 0
        for i in range(len(s),0,-1):
            for j in range(len(s)-i+1):
                if s[j:j+i] in t:
                    max_len = i
                    break
            if max_len :
                break
        print(max_len)
           
                
    except:
        break