Submission #50779108

---

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) {
    Num n {0};
    is >> n;

    for(Num y{0}; y<n; ++y) {
        Vec ps;
        for(Num x{1}; x<=n; ++x) {
            Num a;
            is >> a;
            if (a == 1) {
                ps.push_back(x);
            }
        }

        auto size = ps.size();
        for(size_t i{0}; i<size; ++i) {
            os << ps.at(i);
            if ((i+1) < size) {
                os << " ";
            }
        }
        os << "\n";
    }
}

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

Submission Info

Judge Result