POJ 2891 Strange Way to Express Integers (中国剩余定理)

题意

求最小的x，满足x％m[i]=r[i]。

思路

裸的不互质的中国剩余定理（顺便夸一下这个CRT2的板子真的挺好用的=。=

代码

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define LL long long
#define Lowbit(x) ((x)&(-x))
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1|1
#define MP(a, b) make_pair(a, b)
const int INF = 0x3f3f3f3f;
const int MOD = 1000000007;
const int maxn = 1e5 + 10;
const double eps = 1e-8;
const double PI = acos(-1.0);
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
LL r[maxn], x[maxn], m[maxn];

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

LL inv(LL a, LL p)
{
    LL x, y, d;
    ex_gcd(a, p, x, y, d);
    return d == 1 ? (x % p + p) % p : -1;
}

pll CRT2(LL A[], LL B[], LL M[], int n)      //求解A[i]x = B[i] (mod M[i]),总共n个线性方程组
{
    LL x = 0, m = 1;
    for(int i = 0; i < n; i ++)
    {
        LL a = A[i] * m;
        LL b = B[i] - A[i]*x;
        LL d = __gcd(M[i], a);
        if(b % d != 0)  return MP(0, -1);      //答案不存在，返回-1
        LL t = b / d * inv(a / d, M[i] / d) % (M[i] / d);
        x = x + m * t;
        m *= M[i] / d;
    }
    x = (x % m + m) % m;
    return MP(x, m);                           //返回的x就是答案，m是最后的lcm值
}

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int n;
    while (scanf("%d", &n) != EOF)
    {
        for (int i = 0; i < n; i++)
        {
            x[i] = 1;
            scanf("%lld%lld", &m[i], &r[i]);
        }
        pll ans = CRT2(x, r, m, n);
        if (ans.second == -1) puts("-1");
        else printf("%lld\n", ans.first);
    }
    return 0;
}