output_description: Print one longest string that is a subsequence of both s and t. If there are
  multiple such strings, any of them will be accepted.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      s
      t
attempt: from numba import njit
  S = input()
  T = input()
  dp = [[ "" for _ in range(len(S) + 1 )] for _ in range(len(T) + 1)]
  
  
  @njit
  def solv()
  for i in range(1,len(dp)):
      for j in range(1,len(dp[0])):
          if T[i - 1] == S[j-1]:
              dp[i ][j ] = dp[i-1][j-1] + S[j-1]
          else:
              res1 = dp[i - 1][j]
              res2 = dp[i][j - 1]
              l1 = len(res1)
              l2 = len(res2)
              if l1 > l2:
                  dp[i ][j] = res1
              else:
                  dp[i ][j] = res2
  solv()
  print(dp[-1][-1])
  
problem_description: Statement
  
  You are given strings s and t. Find one longest string that is a subsequence
  of both s and t.
samples: [{"input": "axyb\n    abyxb", "output": "axb\n    \n\nThe answer is `axb` or `ayb`; either will be accepted.\n\n* * *"}, {"input": "aa\n    xayaz", "output": "aa\n    \n\n* * *"}, {"input": "a\n    z", "output": "The answer is `` (an empty string).\n\n* * *"}, {"input": "abracadabra\n    avadakedavra", "output": "aaadara"}]