''' 解题思路: 方法一:(穷举法)以长度小的字符串的子串是否in长串,来判断,如果in,即返回 方法二:动态规划 ''' while 1: try: A = input() B = input() if len(A)>len(B): A,B = B,A #print(A,B) len_A = len(A) len_B = len(B) #print('len_A=',len_A,'len_B=',len_B) k = 0 tmp = '' for L in range(len_A,0,-1): #print('L=',L) for i in range(len_A-L+1): #print(A[i:i+L]) # A[i:i+L]为所有可能子串,逻辑简单 if A[i:i+L] in B: tmp = A[i:i+L] k = 1 break if k==1: break print(tmp) except: break