All in All
Input: standard input
Output: standard output
Time Limit: 2 seconds
Memory Limit: 32 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.
Input Specification
The input contains several testcases. Each is specified by two strings s, t of alphanumeric ASCII characters separated by whitespace. Input is terminated by EOF.
Output Specification
For each test case output, if s is a subsequence of t.
Sample Input
sequence subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter
Sample Output
Yes
No
Yes
No
#include
int main()
{
char a[199999],b[199999];
int i,j;
while (scanf("%s%s",&a,&b)!=EOF)
{
for (i=0,j=0;a[i]!='\0'&&b[j]!='\0';j++)
if (a[i]==b[j])
i++;
if (a[i]=='\0')
printf("Yes\n");
else
printf("No\n");
}
return 0;
}
通过第一个单词的每个字母与第二个去一一比较，如果第一个词先比较完，就是yes，否则no。