poj 1936 All in All-优快云博客

本文链接：https://blog.youkuaiyun.com/Code_KK/article/details/47333875

本文介绍了一种用于验证字符串s是否为字符串t的子序列的有效方法。通过去除t中某些字符，检查剩余字符是否能组成s。输入包含多个测试用例，每个用例由两个字符串s和t组成，需判断s是否为t的子序列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

纯暴力！！！！！，很久没有享受到1Y的感受了

Description

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.

Input

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 no more than 100000.

Output

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

Sample Input

sequence subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter

Sample Output

Yes
No
Yes
No