[BOJ/백준] 9251 LCS

a = input()
b = input()

array = [[0 for i in range(len(b)+1)] for i in range(len(a)+1)]

for i in range(len(a)):
  for j in range(len(b)):
    if a[i] == b[j]:
      array[i+1][j+1] = array[i][j] + 1
    else:
      array[i+1][j+1] = max(array[i][j+1], array[i+1][j])

# 확인용
# for i in range(len(a)):
  # print(array[i])
  
print(array[len(a)][len(b)])