poj 1936 All in All 水题

#include <iostream>
using namespace std;
const int MAX = 100001;
int main(){
char s[MAX], t[MAX], *ps, *pt;
while (cin >> s >> t){
ps = s;
pt = t;
while (*pt){
if (*ps == *pt) ++ps;
if ('\0' == *ps){
cout << "Yes\n";
break;
}
++pt;
}
if (*ps) cout << "No\n";
}
}