{"problem":{"name":"LCS","description":{"content":"You are given strings $s$ and $t$. Find one longest string that is a subsequence of both $s$ and $t$.","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"dp_f"},"statements":[{"statement_type":"Markdown","content":"You are given strings $s$ and $t$. Find one longest string that is a subsequence of both $s$ and $t$.\n\n## Constraints\n\n*   $s$ and $t$ are strings consisting of lowercase English letters.\n*   $1 \\leq |s|, |t| \\leq 3000$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$s$\n$t$\n\n[samples]\n\n## Notes\n\nA _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.","is_translate":false,"language":"English"}],"meta":{"iden":"dp_f","tags":[],"sample_group":[["axyb\nabyxb","axb\n\nThe answer is `axb` or `ayb`; either will be accepted."],["aa\nxayaz","aa"],["a\nz","The answer is (an empty string)."],["abracadabra\navadakedavra","aaadara"]],"created_at":"2026-03-03 11:01:14"}}