Submission #51025809

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    std::string s;
    is >> s;

    Num size = s.size();
    Num l {-1};
    Num r {-1};
    for(Num i{0}; i<size; ++i) {
        const char c = s.at(i);
        if (c == '|') {
            if (l < 0) {
                l = i;
            } else {
                r = i;
            }
        }
    }

    for(Num i{0}; i<size; ++i) {
        if ((i < l) || (i > r)) {
            os << s.at(i);
        }
    }

    os << "\n";
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result