习题3-9 UVA10340 子序列 All in All

#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;

int main() {
    string s1, s2;
    while (cin >> s1 >> s2) {
        int k = 0;
        for (int i = 0; i < s2.size(); i++) {
            if (k < s1.size() && s1[k] == s2[i]) k++;
        }
        cout << (k == s1.size() ? "Yes" : "No") << endl;
    }
    return 0;
}