황소개발자

a = input() b = input() dp = [[0 for i in range(len(a) + 1)] for j in range(len(b) + 1)] for i in range(1, len(b) + 1): for j in range(1, len(a) + 1): if a[j - 1] == b[i - 1]: dp[i][j] = dp[i - 1][j - 1] + 1 else: dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) def findit(): ans = '' now = dp[-1][-1] y = len(dp) - 1 x = len(dp[0]) - 1 while now != 0: if dp[y][x - 1] == now - 1 and now - 1 == dp[y - 1..