题解 | #公共子串计算#
公共子串计算
http://www.nowcoder.com/practice/98dc82c094e043ccb7e0570e5342dd1b
a, b = input(), input()
c= []
for i in range(len(a)+1):
for j in range(i, len(a)+1):
if a[i:(j+1)] in b:
c.append(len(a[i:(j+1)]))
print(max(c))