Lucky Common Subsequence

【问题描述】 通过删除一个字符串中的某些元素而不改变其余元素的顺序，可以派生出该字符 串的一个子序列。 例如，序列BDF 是ABCDEF 的子序列。 字符串的子字符串是该字符串的连续子序列。 例如，BCD 是ABCDEF 的子串。 你得到了两个字符串s1，s2 和另一个名为virus 的字符串。你的任务是找到s1 和s2 的最长公共子序列，同时不包含virus 子字符串。 【输入说明】 输入三行，每行一个字符串：s1、s2 和virus（1 ≤ | s1 |、 | s2 |、 |virus| ≤ 100）。 每个字符串仅由大写英文字母组成。 【输出说明】 输出不带病毒的s1 和s2 的最长公共子序列。如果有多 个答案，任何一个都将被 接受。 如果没有有效的公共子序列，则输出0。

In mathematics, a subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements. For example, the sequence BDF is a subsequence of ABCDEF. A substring of a string is a continuous subsequence of the string. For example, BCD is a substring of ABCDEF. You are given two strings $ s_{1} $ , $ s_{2} $ and another string called $ virus $ . Your task is to find the longest common subsequence of $ s_{1} $ and $ s_{2} $ , such that it doesn't contain $ virus $ as a substring.

The input contains three strings in three separate lines: $ s_{1} $ , $ s_{2} $ and $ virus $ ( $ 1<=|s_{1}|,|s_{2}|,|virus|<=100 $ ). Each string consists only of uppercase English letters.

Output the longest common subsequence of $ s_{1} $ and $ s_{2} $ without $ virus $ as a substring. If there are multiple answers, any of them will be accepted. If there is no valid common subsequence, output 0.

AJKEQSLOBSROFGZ
OVGURWZLWVLUXTH
OZ

ORZ

AA
A
A

0