if you can remove characters from t such that the concatenation of the remaining characters is 
表示删除后面的一些元素后可以找到前面的字符串则还是Yes
#include<iostream>
#include<string>
#include<fstream>
using namespace std;

int main(int argc, char* argv[])
{   
	string a,b;
	//fstream cin("aaa.txt");
	while(cin>>a>>b)
	{ 
	 int le=a.length();
	 int count=0,i=0,j=0;
	 if(a.length()>b.length()){printf("No\n");continue;}
	 for(i=0;j!=b.length()&&i<a.length();)
	 {
		 if(a[i]==b[j]){i++;j++;count++;}
		 else {j++;}
	 }
     if(count==a.length())printf("Yes\n");
	 else printf("No\n");
	}
	return 0;
}