2019牛客暑期多校训练营（第十场）D Han Xin and His Troops（拓展中国剩余定理C++和JAVA版本）

https://ac.nowcoder.com/acm/contest/890/D

板子题套个好板子即可ac

#include<bits/stdc++.h>
using namespace std;
#define ll __int128
#define LL long long
void exgcd(ll a,ll b,ll &g,ll &x,ll &y){
    if(!b){
        g=a;
        x=1;
        y=0;
        return;
    }
    exgcd(b,a%b,g,y,x);
    y-=(a/b)*x;
}
bool flag=false;
ll a1,a2,n1,n2;
void china(){
    ll d=a2-a1;
    ll g,x,y;
    exgcd(n1,n2,g,x,y);
    if(d%g==0){
        x=((x*d/g)%(n2/g)+(n2/g))%(n2/g);
        a1=x*n1+a1;
        n1=(n1*n2)/g;
    }
    else flag=true;
}
LL mo[1005],a[1005];
ll realchina(int n){  
    a1=a[1];
    n1=mo[1];
    for(int i=2;i<=n;i++){
        a2=a[i];
        n2=mo[i];
        china();
        if(flag)return -1;
    }
    return a1;
}
int n;
LL m;
int main(){
    scanf("%d%lld",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%lld%lld",&mo[i],&a[i]);
    }
    ll ans=realchina(n);
    if(ans>m)printf("he was probably lying
");
    else if(ans==-1)printf("he was definitely lying
");
    else printf("%lld
",(LL)ans);
}

//package 实验;
import java.math.BigInteger;
import java.util.Scanner;
import java.util.*;
import java.io.*;
public class Main {
    static BigInteger m[]=new BigInteger[105];
    static BigInteger a[]=new BigInteger[105];
    static BigInteger tmp1;
    static BigInteger tmp2,d,ans,t,x,y;
    static BigInteger z0=BigInteger.ZERO;
    static BigInteger z1=BigInteger.ONE;
    static BigInteger z2=z1.negate();
    boolean flag;
    static BigInteger exgcd(BigInteger a1,BigInteger b1) {
        if(b1.equals(z0)) {
            x=z1;
            y=z0;
            return a1;
        }
        BigInteger d=exgcd(b1,a1.mod(b1));
        BigInteger t2=x;
        x=y;
        BigInteger t1=a1.divide(b1);
        t1=t1.multiply(y);
        y=t2.subtract(t1);
        return d;
    }
    static BigInteger EXCRT(int n){
        BigInteger M=m[1],A=a[1];
        for(int i=2;i<=n;i++){
            BigInteger d=exgcd(M,m[i]);
            BigInteger c=a[i].subtract(A);
            if(c.mod(d) != BigInteger.valueOf(0)) return BigInteger.valueOf(-1);
            BigInteger mul=m[i].divide(d);
            x=(c.divide(d).multiply(x).mod(mul).add(mul)).mod(mul);
            A=A.add(M.multiply(x));
            M=M.multiply(mul);
            A=A.mod(M);
        }
        return (A.add(M)).mod(M);
    }
    public static void main(String [] args){
        Scanner cin = new Scanner(System.in);
        int n;
        BigInteger T;
        n=cin.nextInt();
        T=cin.nextBigInteger();
        for(int i=1;i<=n;i++) {
            m[i]=cin.nextBigInteger();
            a[i]=cin.nextBigInteger();
        }
        BigInteger ans=EXCRT(n);
        if(ans.equals(z2)) {
            System.out.println("he was definitely lying");
        }
        else if(ans.compareTo(T)>0) {
            System.out.println("he was probably lying");
        }
        else {
            System.out.println(ans);
        }
    }
}