G - All in All

灰太狼 2022-10-01 04:51 155阅读 0赞

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, if s is a subsequence of t.

**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 len1,len2;
        char ch1[100000],ch2[100000];
        while(scanf("%s %s",ch1, ch2) != EOF)
        {
            sum = 0;
            len1 = strlen(ch1);
            len2 = strlen(ch2);
            i = 0;
            j = 0;
            while(i < len1)
            { 
                while(j < len2)
                {
                    if(ch1[i] == ch2[j])
                    {
                        sum++;
                        i++;
                        j++;    
                    }
                    else
                    {
                        j++;
                    }
                }
                if(sum == len1)
                {
                    printf("Yes\n");
                    break;
                }   
                else
                {
                    printf("No\n");
                    break;
                }       
            }
        }
        return 0;
    }