Strange Way to Express Integers(poj2891线性同余方程组)

题意：n = ai( mod ri) 给你 n 个 ai 和 ri 求最小满足的n，如果没有解则输出-1

思路：典型的解线性同余方程组

x = a1 (mod r1)

x = a2 (mod r2)

n1*r1 + a1 = n2*r2 + a2

n1*r1 - n2*r1 = a2 - a1;

用扩展欧几里德算出方程的解xi，再得出

x等于 xs = xi * r1 + a1 

x = xs ( mod lcm(r1,r2) )

再和下一个方程接着计算，一直到最后一个方程，xs便是结果，如果中间有一个方程无解，那就是无解输出-1

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long int64;
int64 Exgcd(int64 &x,int64 &y,int64 a,int64 b)
{
    if(b == 0)
    {
        x = 1;y = 0;
        return a;
    }
    else
    {
        int64 r = Exgcd(x,y,b,a%b);
        int64 temp = x;
        x = y, y = temp - a/b*y;
        return r;
    }
}
int main()
{
    int64 n;
    while(scanf("%I64d",&n) != EOF)
    {
        int64 a1,r1;
        int64 a2,r2,x,y,d;
        scanf("%I64d%I64d",&a1,&r1);
        bool flag = 1;
        for(int64 i = 1; i < n; i++)
        {
            scanf("%I64d%I64d",&a2,&r2);
            int64 a = a1,b = a2,c = r2-r1;
            d = Exgcd(x,y,a,b);
            if(c % d != 0)
            {
                flag = 0;
            }
            b = b / d;
            x = x * (c/d);
            x = (x % b + b)% b;
            r1 = x * a1 + r1;
            a1 = a1 * (a2 / d);
        }
        if(flag)
            printf("%I64d\n",r1);
        else
            printf("-1\n");
    }
    return 0;
}