#dpf. [dp_f]LCS
[dp_f]LCS
Problem Statement
You are given strings and . Find one longest string that is a subsequence of both and .
Notes
A subsequence of a string is the string obtained by removing zero or more characters from and concatenating the remaining characters without changing the order.
Constraints
- and are strings consisting of lowercase English letters.
Input
Input is given from Standard Input in the following format:
Output
Print one longest string that is a subsequence of both and . If there are multiple such strings, any of them will be accepted.
Sample Input 1
Sample Output 1
The answer is axb
or ayb
; either will be accepted.
Sample Input 2
Sample Output 2
Sample Input 3
Sample Output 3
The answer is (an empty string).