2018.10.8每天认真做一道数学(数论)题之[TJOI2009]猜数字【中国剩余定理】

由已知：
$$\{\begin{array}{l}(n-a_1)|b_1\\ (n-a_2)|b_2\\ ......\\ (n-a_k)|b_k\end{array}$$

变换一下：
$$\{\begin{array}{l}n-a_1\equiv 0(mod{b}_1)\\ n-a_2\equiv 0(mod{b}_2)\\ ......\\ n-a_k\equiv 0(mod{b}_k)\end{array}$$

再变换一下：
$$\{\begin{array}{l}n\equiv a_1(mod{b}_1)\\ n\equiv a_2(mod{b}_2)\\ ......\\ n\equiv a_k(mod{b}_k)\end{array}$$

然后就直接上$crt$模板，但是这道题有几个地方要注意：
$1.$输入的$a[i]$可能为负
$2.$中间计算结果的时候可能会包$longlong$，中间要用快速乘。

$O(1)$快速乘模板：

inline ll mul(ll x,ll y,ll mod) {
    x%=mod,y%=mod;
    ll z=(long double)x*y/mod,ans=x*y-z*mod;
    
    if(ans<0) ans+=mod;
    else if(ans>=mod) ans-=mod;
    
    return ans;
}

代码：

#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define ll long long
#define rep(i,x,y) for(ll i=(x);i<=(y);i++)
#define repl(i,x,y) for(ll i=(x);i<(y);i++)
#define repd(i,x,y) for(ll i=(x);i>=(y);i--)
using namespace std;

const ll N=1e4+5;
const ll Inf=1e18;

ll k,n,a[N],b[N];

inline ll add(ll x,ll y,ll mod) {
	return x+y>=mod?x+y-mod:x+y;
}

inline ll mul(ll x,ll y,ll mod) {
    x%=mod,y%=mod;
    ll z=(long double)x*y/mod,ans=x*y-z*mod;
    
    if(ans<0) ans+=mod;
    else if(ans>=mod) ans-=mod;
    
    return ans;
}

void exgcd(ll a,ll b,ll &x,ll &y) {
	if(!b) {
		x=1,y=0;return ;
	}exgcd(b,a%b,x,y);
	ll ret=x;x=y;y=ret-a/b*y;
}

void china() {
	ll bb=1;
	
	rep(i,1,k) bb*=b[i];
	
	rep(i,1,k) {
		ll x,y,bi=bb/b[i];
		exgcd(bi,b[i],x,y);
		x=(x%b[i]+b[i])%b[i];
		n=(n+mul(mul(x,bi,bb),a[i],bb))%bb;
	}
	
	n=(n+bb)%bb;
}

int main() {
	scanf("%lld",&k);
	
	rep(i,1,k) scanf("%lld",&a[i]);
	
	rep(i,1,k) scanf("%lld",&b[i]);
	
	rep(i,1,k) a[i]=(a[i]%b[i]+b[i])%b[i];
	
	china();
	
	printf("%lld\n",n);

	return 0;
}