POJ 1936 All in All

#include <iostream>
#include <cstdio>
#include <cstring>
#define REP(i, s, n) for(int i = s; i <= n; i ++)
#define REP_(i, s, n) for(int i = n; i >= s; i --)
#define MAX_N 100000 + 10

using namespace std;

char s[MAX_N], t[MAX_N];
int ls, lt;

int main(){
    while(scanf("%s %s", s + 1, t + 1) != EOF){
        ls = strlen(s + 1); lt = strlen(t + 1);
        int node_s = 1, node_t = 1;
        bool match[MAX_N];
        memset(match, 0, sizeof(match));
        while(node_s <= ls && node_t <= lt){
            if(s[node_s] == t[node_t]) match[node_s] = 1, node_s ++, node_t ++;
            else node_t ++;
        }
        bool tmp = 1;
         REP(i, 1, ls) if(!match[i]){ tmp = 0; break; }
        
        if(tmp) printf("Yes\n");
        else printf("No\n");
    }
    return 0;
}