LCS-2
Very easy
Execution time limit is 1 second
Runtime memory usage limit is 128 megabytes
Two strings are given. Find their longest common subsequence.
Input
Two strings consisting of small Latin letters. The length of each string is no more than 1000.
Output
Print the longest common subsequence of two strings.
Examples
Input #1
Answer #1
Input #2
Answer #2
Submissions 1K
Acceptance rate 39%