一本通1634：【例 4】曹冲养猪

最新推荐文章于 2024-10-02 23:40:03 发布

我是小蒟蒻

最新推荐文章于 2024-10-02 23:40:03 发布

阅读量106

点赞数 1

文章标签：算法 c++

本文链接：https://blog.csdn.net/liu12345635/article/details/137734629

版权

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<iostream>
#define ll long long 
#define M 22
#define mmp make_pair
using namespace std;
int read()
{
    int nm = 0, f = 1;
    char c = getchar();
    for(; !isdigit(c); c = getchar()) if(c == '-') f = -1;
    for(; isdigit(c); c = getchar()) nm = nm * 10 + c - '0';
    return nm * f;
}
 
ll gcd(ll a, ll b)
{
    return !b ? a : gcd(b, a % b);
}
 
ll exgcd(ll a, ll b, ll &x, ll &y)
{
    if(!b)
    {
        x = 1, y = 0;
        return a;
    }
    else
    {
        ll d = exgcd(b, a % b, x, y);
        ll tmp = x;
        x = y;
        y = tmp - a / b * y;
        return d;
    }
}
 
ll inv(ll a, ll p)
{
    ll x, y;
    ll d = exgcd(a, p, x, y);
    if(d != 1) return -1;
    return (x % p + p) % p;
}
ll a[M], b[M], n; 
 
ll excrt()
{
    ll a1 = a[1], m1 = b[1], a2, m2;
    for(int i = 2; i <= n; i++)
    {
        a2 = a[i], m2 = b[i];
        ll c = a2 - a1, d = gcd(m1, m2);
        if(c % d) return -1;
        ll k = inv(m1 / d, m2 / d);
        m2 = m1 / d * m2;
        a1 = m1 * c / d % m2 * k + a1;
        m1 = m2;
        a1 = (a1 % m1 + m1) % m1;           
    }
    return a1;
}
 
int main()
{
    n = read();
    for(int i = 1; i <= n; i++) b[i] = read(), a[i] = read();
    cout << excrt() << "\n";
    return 0;
}