#1166636 (C++23) No.2558 中国剰余定理

• 問題: No.2558 中国剰余定理
• ユーザー: ooaiu
• 提出日時: 2026-05-25 13:20:24
• 言語: C++23 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 4,722 bytes
• コンパイル時間: 2,305 ms
• コンパイル使用メモリ: 337,440 KB
• 実行使用メモリ: 6,400 KB
• 最終ジャッジ日時: 2026-05-25 13:20:35
• 合計ジャッジ時間: 3,558 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge3_0

ファイルパターン	結果
sample	AC * 3
other	AC * 29

ソースコード

#include <bits/stdc++.h>
using namespace std;


template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};

using ll = long long;
using u32 = unsigned int;
using u64 = unsigned long long;

using vi = vector<int>;
using vl = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T, class U = std::less<T>> using prique = priority_queue<T, vector<T>, U>;

#define overload(a, b, c, d, e, ...) e
#define len(x) (ll)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep1(n) for (ll _ = 0; _ < ll(n); _++)
#define rep2(i, n) for (ll i = 0; i < ll(n); i++)
#define rep3(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rep4(i, a, b, c) for (ll i = ll(a); i < ll(b); i += ll(c))
#define rep(...) overload(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, n) for (ll i = n; i--;)

template <class T> void dedup(vector<T>& a) { sort(all(a)), a.erase(unique(all(a)), a.end()); }
template <class T> bool chmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template <class T> bool chmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }

namespace cppio {

template <typename T> struct is_tuple_like : false_type {};
template <typename... Ts> struct is_tuple_like<tuple<Ts...>> : true_type {};
template <typename T, typename U> struct is_tuple_like<pair<T, U>> : true_type {};

template <typename T, typename = void> struct is_container : false_type {};
template <typename T> struct is_container<T, void_t<decltype(begin(declval<T&>()))>> : bool_constant<!is_same_v<decay_t<T>, string> && !is_same_v<decay_t<T>, char*> && !is_same_v<decay_t<T>, const char*> && !is_array_v<remove_reference_t<T>>> {};

template <typename T> void _in(T& x) {
    if constexpr (is_tuple_like<T>::value) apply([](auto&... elems) { (_in(elems), ...); }, x);
    else if constexpr (is_container<T>::value) {
        for (auto& e : x) _in(e);
    } else cin >> x;
}

template <typename... Ts> void _in_all(Ts&... args) { (_in(args), ...); }

template <typename T> void _out(const T& x) {
    if constexpr (is_tuple_like<T>::value) {
        bool first = true;
        apply([&](const auto&... elems) { ((cout << (first ? "" : " "), _out(elems), first = false), ...); }, x);
    } else if constexpr (is_container<T>::value) {
        bool first = true;
        for (const auto& e : x) {
            if (!first) cout << ' ';
            _out(e);
            first = false;
        }
    } else cout << x;
}

template <typename... Ts> void _out_all(const Ts&... args) {
    bool first = true;
    ((cout << (first ? "" : " "), _out(args), first = false), ...);
    cout << '\n';
}
template <typename... Ts> void _out_no_el(const Ts&... args) {
    bool first = true;
    ((cout << (first ? "" : " "), _out(args), first = false), ...);
}

}  // namespace cppio

#define IN(...) cppio::_in_all(__VA_ARGS__)
#define OUT(...) cppio::_out_all(__VA_ARGS__)
#define out(...) cppio::_out_no_el(__VA_ARGS__)

#define INT(...) int __VA_ARGS__; IN(__VA_ARGS__)
#define LL(...)  ll __VA_ARGS__; IN(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; IN(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; IN(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; IN(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); IN(name)
#define VV(type, name, h, w)  vector<vector<type>> name(h, vector<type>(w)); IN(name)
#define RETURN(...) do { __VA_ARGS__; return; } while (0)

bool Yes(bool b = true) { OUT(b ? "Yes" : "No"); return b; }
bool No(bool b = true) { Yes(!b); return b; }
bool YES(bool b = true) { OUT(b ? "YES" : "NO"); return b; }
bool NO(bool b = true) { YES(!b); return b; }

#ifdef ONLINE_JUDGE
#define debug(...) (void(0))
#endif

#include <atcoder/math>
template <class T> vector<T> garnerz(const vector<T>& a, const vector<T>& m) {
    assert(a.size() == m.size());
    vector<T> c(a.size());
    T x = 0;
    for (int i = 0; i < a.size(); i++) {
        T M = 1;
        for (int j = 0; j < i; j++) {
            M *= m[j];
            M %= m[i];
        }
        c[i] = atcoder::inv_mod(M, m[i]) * (a[i] - x);
        x += c[i] * M;
        x %= m[i];
    }
    return c;
}

void solve() {
    INT(A, B, a, b);
    auto c = garnerz<ll>({a, b}, {A, B});
    ll ans = c[0];
    ans += c[1] * A;
    ans %= A * B;
    ans += A * B;
    ans %= A * B;
    OUT(ans);
}
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll t = 1;
    while (t--) solve();
}