All in All

来源:互联网 发布:淘宝卡卡lee 编辑:程序博客网 时间:2024/06/15 08:22

UVa10340

#include <stdio.h>#include <string.h>const int maxn = 1000005;char s[maxn], t[maxn];int main ( ){    int len;    while ( ~ scanf ( "%s%s", s, t ) )    {        len = strlen ( s );        int i = 0;  //i移动        for ( int j = 0; t[j] && i < len; j ++ )            if ( s[i] == t[j] )                i ++;        printf ( i >= len ? "Yes\n" : "No\n" );    }    return 0;}


0 0