1425. All in All

单点时限: 2.0 sec

内存限制: 256 MB

You have devised a new encryption technique which encodes a message by inserting between its characters randomly generated strings in a clever way. Because of pending patent issues we will not discuss in detail how the strings are generated and inserted into the original message. To validate your method, however, it is necessary to write a program that checks if the message is really encoded in the final string.

Given two strings and , you have to decide whether is a subsequence of , i.e. if you can remove characters from such that the concatenation of the remaining characters is .

输入格式

The input contains several testcases. Each is specified by two strings of alphanumeric ASCII characters separated by whitespace.The length of and will be no more than 100000.

输出格式

For each test case output Yes, if is a subsequence of ,otherwise output No.

样例

Input
sequence subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter
Output
Yes
No
Yes
No

423 人解决,488 人已尝试。

526 份提交通过,共有 1390 份提交。

1.7 EMB 奖励。

创建: 12 年,1 月前.

修改: 11 月,1 周前.

最后提交: 1 周,1 天前.

来源: Ulm Local 2002

题目标签
DP