POJ 1936-All-in-AL(サブシーケンス)
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
Sample Output
タイトル:入力した2つの文字列で、後者の文字には前者の文字が含まれ、順序が正しい.たとえば、テストデータ2では、後者の文字列は前者の文字列のすべての内容を含むが、文字列1は文字列2のサブシーケンスではない.
コードは次のとおりです.
strcpy()strstr()などの使用を学ぶ.
ブログはすでに引っ越しました:洪学林ブログ
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タイトル:入力した2つの文字列で、後者の文字には前者の文字が含まれ、順序が正しい.たとえば、テストデータ2では、後者の文字列は前者の文字列のすべての内容を含むが、文字列1は文字列2のサブシーケンスではない.
コードは次のとおりです.
strcpy()strstr()などの使用を学ぶ.
ブログはすでに引っ越しました:洪学林ブログ