题解 | #公共子串计算#

a=input()
b=input()
if len(a)>len(b):
    a,b=b,a
max_len=len(a)
while max_len>0:
    printf=False    
    for i in range(len(a)-max_len+1):
        if a[i:i+max_len] in b:
            print(len(a[i:i+max_len]))
            printf=True
            break
    max_len-=1
    if printf:
        break 
if not printf:
    print("0")