题解 | #字符串字符匹配#

#include <iostream>
#include <set>
#include <algorithm>
using namespace std;

int main() {
    set<char> s, t;
    string sa, ta;
    cin >> sa >> ta;
    for (auto x : sa)
    {
        s.insert(x);
    }
    for (auto x : ta)
    {
        t.insert(x);
    }
    bool exist = includes(t.begin(), t.end(), s.begin(), s.end());
    if (exist)
    {
        cout << "true";
    }
    else
    {
        cout << "false";
    }
    return 0;
}