1.题目链接。考虑这样一个问题,存在一个同余方程组,其中模mi两两互质,求出满足这个方程组的最小的非负整数。
中国剩余定理就是干这件事的,其实也没什么神奇的,就是通过不断合并解得到最终答案。
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
#pragma warning(disable:4996)
ll k;
//k个数据
/*
n%a[1]=b[1];
n%a[2]=b[2];
............
n%a[k]=b[k];
求最小的n满足这个同余的方程组
*/
ll a[20], b[20];
//加上快速乘法
ll qmul(ll a, ll b, ll mod)
{
ll ans = 0;
while (b > 0)
{
if (b & 1) ans = (ans + a) % mod;
a = (a + a) % mod;
b >>= 1;
}
return ans;
}
void exgcd(ll a, ll b, ll &x, ll &y)
{
if (b == 0) { x = 1; y = 0; return; }
exgcd(b, a%b, x, y);
int tp = x;
x = y; y = tp - a / b * y;
}
ll china()
{
ll ans = 0, lcm = 1, x, y;
for (int i = 1; i <= k; ++i) lcm *= b[i];
for (int i = 1; i <= k; ++i)
{
ll tp = lcm / b[i];
exgcd(tp, b[i], x, y);
//这里的X要取最小的非负整数x,在使用exgcd时,最小的非负整数x是有公式的
x = (x%b[i] + b[i]) % b[i];
ans = (ans + qmul(qmul(tp, x, lcm), a[i], lcm)) % lcm;
}
return (ans + lcm) % lcm;
}
int main()
{
scanf("%lld", &k);
for (int i = 1; i <= k; i++)
{
scanf("%lld", &a[i]);
}
for (int j = 1; j <= k; j++)
{
scanf("%lld", &b[j]);
}
for (int i = 1; i <= k; i++) a[i] = (a[i] % b[i] + b[i]) % b[i];
cout << china();
return 0;
}