verify/yukicoder/yukicoder_186.test.cpp

View this file on GitHub
Last update: 2024-06-26 03:18:46+09:00
Problem: https://yukicoder.me/problems/no/186

Depends on

Code

#define PROBLEM "https://yukicoder.me/problems/no/186"

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

#include "../../math/crt.hpp"

int main() {
    vector<long long> X(3), Y(3);
    for(int i = 0; i < 3; i++) {
        cin >> X[i] >> Y[i];
    }
    auto [r, m] = crt(X, Y);
    
    if(m == -1) cout << -1 << endl;
    else if(r == 0) cout << m << endl;
    else cout << r << endl;

    return 0;
}

#line 1 "verify/yukicoder/yukicoder_186.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/186"

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

#line 1 "math/ext_gcd.hpp"
tuple<long long, long long, long long> ext_gcd(long long a, long long b) {
    if(b == 0) return {a, 1, 0};
    auto [d, y, x] = ext_gcd(b, a % b);
    y -= a / b * x;
    return {d, x, y};
}
#line 2 "math/crt.hpp"

inline long long safe_mod(long long a, long long m) {
    return (a % m + m) % m;
}

pair<long long, long long> crt(const vector<long long>& b, const vector<long long>& m) {
    assert(b.size() == m.size());
    long long r = 0, M = 1;
    for(int i = 0; i < (int)b.size(); i++) {
        auto [d, p, q] = ext_gcd(M, m[i]);
        if((b[i] - r) % d != 0) return {0, -1};
        long long tmp = (b[i] - r) / d * p % (m[i] / d);
        r += M * tmp;
        M *= m[i] / d;
    }
    r = safe_mod(r, M);
    return {r, M};
}
#line 7 "verify/yukicoder/yukicoder_186.test.cpp"

int main() {
    vector<long long> X(3), Y(3);
    for(int i = 0; i < 3; i++) {
        cin >> X[i] >> Y[i];
    }
    auto [r, m] = crt(X, Y);
    
    if(m == -1) cout << -1 << endl;
    else if(r == 0) cout << m << endl;
    else cout << r << endl;

    return 0;
}