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. Input is terminated by EOF.
Output
For each test case output, print "Yes" if s is a subsequence of t or "No" if not.
Sample Input
sequence subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter
Sample Output
Yes
No
Yes
No
#include<stdio.h>
#include<string.h>
int main()
{
int i,j,sum=0;
int l1,l2;
char ee[100000],u[100000];
while(~scanf("%s %s",ee, u))
{
sum = 0;
l1 = strlen(ee);
l2 = strlen(u);
i = 0,j=0;
while(i<l1)
{
while(j<l2)
{
if(ee[i]==u[j])
{
sum++;
i++;
j++;
}
else
j++;
}
if(sum==l1)
{
printf("Yes\n");
break;
}
else
{
printf("No\n");
break;
}
}
}
return 0;
}
题意 给出两个字符串,判断串1是否为串2的子串,这里的子串不要求在串2中连续,但是要保证顺序一致。
输入 每行一两个字符串s,t,s代表原来的消息,t代表加密后的密文。
输出 每个输出占一行。如果s是t的子串,就输出"Yes",否则输出"No"