import time
def lcs(pattern_1, pattern_2):
    m = len(pattern_1)
    n = len(pattern_2)
# dp will store solutions as the iteration goes on
    dp = [[None] * (n + 1) for item in range(m + 1)]
    for i in range(m + 1):
      for j in range(n + 1):
         if i == 0 or j == 0:
            dp[i][j] = 0
         elif pattern_1[i-1] == pattern_2[j-1]:
            dp[i][j] = dp[i-1][j-1] + 1
         else :
            dp[i][j] = max(dp[i-1][j], dp[i][j-1])
    return dp[m][n]
w1 = (input("word 1? "))
w2 = (input("word 2? "))
start_time = time.time()
print(lcs(w1,w2))
print ("Time taken for dynamic programming solution was ", \
                (time.time() - start_time)," seconds.")