uva 10340 All in All

/**************************************************************************
user_id: SCNU20102200088
problem_id: uva 10340
problem_name: All in All
**************************************************************************/

#include <algorithm>
#include <iostream>
#include <iterator>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <bitset>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
using namespace std;

//线段树
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1

//手工扩展栈
#pragma comment(linker,"/STACK:102400000,102400000")

const double EPS=1e-9;
const double PI=acos(-1.0);
const double E=2.7182818284590452353602874713526;  //自然对数底数
const double R=0.5772156649015328606065120900824;  //欧拉常数:(1+1/2+...+1/n)-ln(n)

const int x4[]={-1,0,1,0};
const int y4[]={0,1,0,-1};
const int x8[]={-1,-1,0,1,1,1,0,-1};
const int y8[]={0,1,1,1,0,-1,-1,-1};

typedef long long LL;

typedef int T;
T max(T a,T b){ return a>b? a:b; }
T min(T a,T b){ return a<b? a:b; }
T gcd(T a,T b){ return b==0? a:gcd(b,a%b); }
T lcm(T a,T b){ return a/gcd(a,b)*b; }

///////////////////////////////////////////////////////////////////////////
//Add Code:
///////////////////////////////////////////////////////////////////////////

int main(){
std::ios::sync_with_stdio(false);
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
///////////////////////////////////////////////////////////////////////
//Add Code:
char a[100005],b[100005];
while(scanf("%s%s",a,b)!=EOF){
int alen=strlen(a),blen=strlen(b);
if(blen<alen){
printf("No\n");
continue;
}
int cnt=0,num=0;
while(num<blen){
if(a[cnt]==b[num]) cnt++;
num++;
}
if(cnt==alen) printf("Yes\n");
else printf("No\n");
}
///////////////////////////////////////////////////////////////////////
return 0;
}

/**************************************************************************
Testcase:
Input:
sequence subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter
Output:
Yes
No
Yes
No
**************************************************************************/