UVA 10340 - All in All

10340 - All in All

Time limit: 3.000 seconds

You have devised a new encryption technique which encodes a message by inserting between its charactersrandomly generated strings in a clever way. Because of pending patent issues we will not discuss indetail 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 finalstring.

Given two strings s and t, you have to decide whether s is a subsequence of t, i.e. if you can removecharacters 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 ASCIIcharacters separated by whitespace. Input is terminated by EOF.

Output

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 <iostream>#include<cstdio>#include<cstring>#define maxn 100010using namespace std;char s[maxn],t[maxn];int main(){    while(~scanf("%s%s",s,t))    {        int lent=strlen(t);        int lens=strlen(s);        int j=0;        for(int i=0;i<lent&&j<lens;++i)        {            if(t[i]==s[j])                j++;            if(lens-j>lent-i)                break;        }        if(j==lens)            printf("Yes\n");        else            printf("No\n");        memset(s,'\0',sizeof(s));        memset(t,'\0',sizeof(t));    }    return 0;}