#include<cstdio>
#include<queue>
#include<map>
using namespace std;
typedef __int64 LL;
LL gcd(LL a, LL b){
return b==0?a:gcd(b, a%b);
}
void extend_gcd(LL a, LL b, LL &d, LL &x, LL &y){
if(!b){
d=a; x=1; y=0;
}
else {
extend_gcd(b, a%b, d, y, x); y-=x*(a/b);
}
}
LL china(int n, LL *m, LL *a){
LL lcm=1;
for(int i=1; i<=n; i++){
lcm=lcm/gcd(lcm,m[i])*m[i];
}
m[0]=m[1],a[0]=a[1];
for(int i=2; i<=n; i++){
LL A=m[0], B=m[i], d, x, y, c=a[i]-a[0];
extend_gcd(A, B, d, x, y);
if(c%d)return -1;
LL mm=m[i]/d;
LL K=((x*c/d)%mm+mm)%mm;
a[0]=m[0]*K+a[0];
m[0]=m[0]*m[i]/d;
}
if(a[0]==0)return lcm;
return a[0];
}
int main(){
return 0;
}
中国剩余
最新推荐文章于 2020-09-09 16:24:59 发布