UVA - 10340 All in All

//

应该有好用的函数 直接查找

//

#include<iostream>#include<cstdio>#include<string.h>using namespace std;int main(){    string s, t;    while(cin >> s >> t)    {        int len1 = s.size();        int len2 = t.size();        int ipos = 0;        bool ok = false;        if(len1 > len2) cout << "No" << endl;        else        {            for(int i = 0; i < len1; ++i)            {                ok = false;                for(int j = ipos; j < len2; ++j)                {                    if(s[i] == t[j])                    {                        ipos = j+1;                        ok = true;                        break;                    }                }                if(!ok) {cout << "No" << endl; break;}            }        }        if(ok) cout << "Yes" << endl;        s.clear();        t.clear();    }    return 0;}