656 人解决，730 人已尝试。
855 份提交通过，共有 2192 份提交。
1.2 EMB 奖励。
单点时限: 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 $s$ and $t$, you have to decide whether $s$ is a subsequence of $t$, i.e. if you can remove characters from $t$ such that the concatenation of the remaining characters is $s$.
The input contains several testcases. Each is specified by two strings $s,\ t$ of alphanumeric ASCII characters separated by whitespace.The length of $s$ and $t$ will be no more than 100000.
For each test case output Yes, if $s$ is a subsequence of $t$,otherwise output No.
sequence subsequence person compression VERDI vivaVittorioEmanueleReDiItalia caseDoesMatter CaseDoesMatter
Yes No Yes No
656 人解决，730 人已尝试。
855 份提交通过，共有 2192 份提交。
1.2 EMB 奖励。