Submission #50407640

---

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;

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

    Num mul_n = n;
    Num mul_m = m;
    Num ofs {0};
    while(rem-- >= 0) {
        ofs = std::min(mul_n, mul_m);
        if (mul_n < mul_m) {
            mul_n += n;
        } else {
            mul_m += m;
        }
    }

    os << (l * div + ofs) << "\n";
}

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

Submission Info

Judge Result