提出 #50193950

---

ソースコード 拡げる

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

using namespace atcoder;

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>>;
}

Num extgcd(Num a, Num b, Num& x, Num& y) {
    Num d = a;
    if (b != 0) {
        d = extgcd(b, a % b, y, x);
        y -= (a / b) * x;
    } else {
        x = 1;
        y = 0;
    }

    return d;
}

void solve(std::istream& is, std::ostream& os) {
    Num x, y;
    is >> x >> y;

    const auto g = std::gcd(std::abs(x), std::abs(y));
    if (g > 2) {
        os << "-1\n";
        return;
    }

    Num c {0};
    Num d {0};
    extgcd(y, -x, c, d);
    c *= (2/g);
    d *= (2/g);
    os << c << " " << d << "\n";
}

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

提出情報

ジャッジ結果