题解 | #公共子串计算#

def f(s1,s2):
    m=0
    dp=[[0 for j in range(len(s2)+1)] for i in range(len(s1)+1)]
    for i in range(len(s1)):
        for j in range(len(s2)):
            if s1[i]==s2[j]:
                dp[i+1][j+1]=dp[i][j]+1
                if dp[i+1][j+1]>m:
                    m=dp[i+1][j+1]
    return m
while True:
    try:
        s1,s2=input(),input()
        print(f(s1,s2))
    except:
        break