{"raw_statement":[{"iden":"problem statement","content":"You are given strings $s$ and $t$. Find one longest string that is a subsequence of both $s$ and $t$."},{"iden":"notes","content":"A _subsequence_ of a string $x$ is the string obtained by removing zero or more characters from $x$ and concatenating the remaining characters without changing the order."},{"iden":"constraints","content":"*   $s$ and $t$ are strings consisting of lowercase English letters.\n*   $1 \\leq |s|, |t| \\leq 3000$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$s$\n$t$"},{"iden":"sample input 1","content":"axyb\nabyxb"},{"iden":"sample output 1","content":"axb\n\nThe answer is `axb` or `ayb`; either will be accepted."},{"iden":"sample input 2","content":"aa\nxayaz"},{"iden":"sample output 2","content":"aa"},{"iden":"sample input 3","content":"a\nz"},{"iden":"sample output 3","content":"The answer is (an empty string)."},{"iden":"sample input 4","content":"abracadabra\navadakedavra"},{"iden":"sample output 4","content":"aaadara"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}