Submission #50379685

---

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, m, k;
    is >> n >> m >> k;
    if (n > m) {
        std::swap(n, m);
    }

    bool mul = (m % n) == 0;

    const auto l = std::lcm(n, m);
    const auto size = l / n + l / m - 2;
    Num div = (k - 1) / size;
    Num rem = (k - 1) % size;

    PQ<Num> q;
    q.push(n);
    q.push(m);
    Num ofs = 0;

    while(rem-- >= 0) {
        const auto cur = q.top();
        q.pop();
        ofs = cur;

        if ((cur % n) == 0) {
            Num nc = cur + n;
            if (nc < l) {
                q.push(nc);
            }
        } else if (!mul) {
            Num mc = cur + m;
            if (mc < l) {
                q.push(mc);
            }
        }
    }

    Num ans = l * div + ofs;
    os << ans << "\n";
}

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

Submission Info

Judge Result