uva10340 (字符串模拟)

不解释，直接上源码。

#include <stdio.h>
#include <string.h>

const int maxn = 1e6 + 5;
char s[maxn],t[maxn];
int main()

{
    while(~scanf("%s%s",s,t))
    {
        int len_s = strlen(s);
        int len_t = strlen(t);
        if(len_s > len_t)
                printf("No\n");
        else if(!strcmp(s,t))
                printf("Yes\n");
        else
        {
            int i = 0;
            int j = 0;
            while(i < len_s)
            {
                int flag = 0;
                while(j < len_t)
                    if(t[j++] == s[i])
                    {
                        flag = 1;
                        break;
                    }
                if(!flag)
                    break;
                else ++i;
            }
            if(i == len_s)
                printf("Yes\n");
            else
                printf("No\n");
        }
    }
    return 0;
}