POJ 1936

#include<iostream>
#include<string>
using namespace std;

int main()
{
    //freopen("acm.acm","r",stdin);
    string s1;
    string s2;
    int len_1;
    int len_2;
    int i;
    int j;
    int index;
    while(cin>>s1>>s2)
    {
    //    cout<<s1<<endl;
    //    cout<<s2<<endl;
        len_1 = s1.length();
        len_2 = s2.length();
        index = 0;
        for(i = 0; i < len_1; ++ i)
        {
            for(j = index; j < len_2; ++ j)
            {
                if(s1[i] == s2[j])
                {
                    index = j+1;
                    break;
                }
            }
            if(j == len_2)
            {
                break;
            }
        }
        if(i == len_1)
        {
            cout<<"Yes"<<endl;
        }
        else
        {
            cout<<"No"<<endl;
        }
    }
}

关注我的公众号，当然，如果你对Java, Scala, Python等技术经验，以及编程日记，感兴趣的话。 

技术网站地址： vmfor.com