Задача Словарик - C++ - Ответ 13776502

#include <iostream>
#include <string>
#include <list>
#include <unordered_set>
#include <algorithm>
#include <iterator>
 
template<typename InIt, typename OutIt>
void split_mod
(
    InIt it_begin_s,
    InIt it_end_s,
    InIt it_begin_seps,
    InIt it_end_seps,
    OutIt it_out
);
 
int main()
{
    std::string seps(" ,.-:!?");
    auto string_down = [](std::string in)
    {
        std::transform(std::begin(in), std::end(in), std::begin(in), ::towlower);
        return in;
    };
 
    std::string line;
    std::getline(std::cin, line);
    std::list<std::string> words;
    split_mod(std::begin(line), std::end(line), std::begin(seps), std::end(seps), std::back_inserter(words));
    std::transform(std::begin(words), std::end(words), std::begin(words), string_down);
    std::unordered_set<std::string> unique_words;
    std::copy(std::begin(words), std::end(words), std::inserter(unique_words, std::end(unique_words)));
    std::cout << unique_words.size() << "\n";
 
    return 0;
}
 
template<typename InIt, typename OutIt>
void split_mod
(
    InIt it_begin_s,
    InIt it_end_s,
    InIt it_begin_seps,
    InIt it_end_seps,
    OutIt it_out
)
{
    if (!is_sorted(it_begin_seps, it_end_seps))
        sort(it_begin_seps, it_end_seps);
    using S = typename std::basic_string<std::iterator_traits<InIt>::value_type>;
    InIt it_old = it_begin_s;
    for (InIt it = it_begin_s; it != it_end_s; ++it)
        if (std::binary_search(it_begin_seps, it_end_seps, *it))
        {
            if (it_old != it)
                * it_out++ = S(it_old, it);
            it_old = it;
            std::advance(it_old, 1u);
        }
    if (it_old != it_end_s)
        * it_out++ = S(it_old, it_end_s);
}