All in All

旧城等待， 2022-08-10 06:12 109阅读 0赞

## All in All ##

##### Time Limit: 1000ms Memory limit: 65536K 有疑问？点这里^\_^ #####

## 题目描述 ##

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*.

## 输入 ##

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.

## 输出 ##

For each test case output, if*s*is a subsequence of*t*.

## 示例输入 ##

sequence subsequence
    person compression
    VERDI vivaVittorioEmanueleReDiItalia
    caseDoesMatter CaseDoesMatter

## 示例输出 ##

Yes
    No
    Yes
    No

## 提示 ##

## 来源 ##

2002/2003 University of Ulm Local Contest

## 示例程序 ##

#include<stdio.h>    
    #include<string.h>    
    char a[1000000],b[1000000];    
    int main()    
    {    
        int i,j,n,m,k,t;    
        while(scanf("%s %s",a,b)!=EOF)    
        {    
            n=strlen(a);    
            m=strlen(b);    
            j=0;    
            for(i=0;i<m;i++)    
                if(a[j]==b[i])    
                {    
                    j++;    
                }    
                if(j==n)    
                    printf("Yes\n");    
                else    
                    printf("No\n");    
        }    
    }