直接暴力模拟即可。。(好像还可以dp???)
#include<cstdio>
#include<cstring>
#include<iostream>
#include<cstdlib>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
using namespace std;
#define maxx 10000000
char s1[maxx],s2[maxx];
int f[maxx];
int main()
{
//freopen("std.in","r",stdin);
//freopen("std.out","w",stdout);
while(cin>>s1>>s2)
{
memset(f,0,sizeof(f));
int m = strlen(s1);
int n = strlen(s2);
int i,j;
for(i = 0,j=0;i<m&&j<n;)
{
if(s1[i]==s2[j]) {i++;j++;}
else j++;
}
if(i==m) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}