7-133 4103 All in All

#include <algorithm>
#include <cstdint>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using pii = std::pair<i32, i32>;
using pll = std::pair<i64, i64>;
using vi = std::vector<i32>;
using vll = std::vector<i64>;
using vpii = std::vector<pii>;
using vpll = std::vector<pll>;

void solve();

int main()
{
    std::cin.tie(nullptr)->sync_with_stdio(false);
    solve();
}

bool isSubsequence(const std::string &s, const std::string &t)
{
    u64 i = 0, j = 0;
    while (i < s.size() && j < t.size())
    {
        if (s[i] == t[j])
        {
            ++i;
        }
        ++j;
    }
    return i == s.size();
}

void solve()
{
    bool endl = false;
    std::string str1, str2;
    while (std::cin >> str1 >> str2)
    {
        if (endl)
        {
            std::cout << '\n';
        }
        std::cout << (isSubsequence(str1, str2) ? "Yes" : "No");
        endl = true;
    }
}