P3868 [TJOI2009]猜数字

https://www.luogu.org/problemnew/show/P3868

 

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=2e5+9;
const int mod=1e8+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

//扩展欧几里得算法
void exgcd(ll a,ll b,ll &d,ll &x,ll &y)
{
    if(b==0){
        d=a;
        x=1,y=0;
    }
    else{
        exgcd(b,a%b,d,y,x);
        y-=(a/b)*x;
    }
}

//快速乘
ll qmul(ll a,ll b,ll M)
{
    ll ans=0;
    while(b>0)
    {
        if(b&1) ans=(ans+a)%M;
        a=(a+a)%M;
        b>>=1;
    }
    return ans;
}
//中国剩余定理
ll China(int n,ll *m,ll *a)
{
    ll lcm=1,d=0,y=0,x=0;
    ll ans=0;
    for(int i=0;i<n;i++) lcm*=m[i];
    for(int i=0;i<n;i++)
    {
        ll tp=lcm/m[i];
        exgcd(tp,m[i],d,x,y);
        x=(x%m[i]+m[i])%m[i];
        ans=(ans+qmul(qmul(tp,x,lcm),a[i],lcm))%lcm;//tp*a[i]*x
    }
    return (ans+lcm)%lcm;
}
ll m[19],a[19];
int main()
{
    //FASTIO;
    //#define endl '\n'
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        scanf("%lld",&a[i]);
    for(int i=0;i<n;i++)
        scanf("%lld",&m[i]);
    for(int i=0;i<n;i++)
        a[i]=(a[i]%m[i]+m[i])%m[i];
    printf("%lld",China(n,m,a));
}