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: S=input()
  T=input()
  s=len(S)
  t=len(T))
  dp=[['' for i in range(T+1)] for j in range(T+1)]
  for i in range(S):
      for j in range(T):
          if s[i]==t[j]:
              dp[i+1][j+1]=dp[i][j]+s[i]
          else:
              dp[i+1][j+1]=dp[i+1][j]
              if len(dp[i][j+1])>len(dp[i+1][j]):
                  dp[i+1][j+1]=dp[i][j+1]
  print(dp[S][T])
  
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"}]