求解 一元线性同余方程 ax = b (mod m)
1.ax - my = b
2.a * x' + m * y' = d = gcd(a,m) 中的x',y'可由扩展gcd求得
3.a * (x' * b / d) + m * (y' * b / d) = b
原方程的解x = x' * b / d
4.且原方程有d个对于m不同余的解,分别为x,x + m / d,x + 2m / d 。。。(mod m)
方程ax = b (mod m) 解-> x = x0,x0 + m / b,x0 + 2m / b ...
x0为其中一个解,但不一定是最小整数解。
x的d个解,均为关于x0的线性组合步长为m / d,最小整数解为( (x0 % m/d) + m/d ) % m/d
一元线性同余方程组
x = b1 (mod m1)
x = b2 (mod m2)
x = b3 (mod m3)
...
1.取前2个方程
x = m1 * y1 + b1 = m2 * y2 + b2
m1 * y1 + m2 * y2 = b2 - b1 = c
2.由扩展gcd(m1,m2,x,y,d)
可求出 m1 * y1' + m2 * y2' = d的y1',y2'
m1 * (y1' * c / d) + m2 * (y2' * c / d) = c
y1,y2即已知,为d个解中某个解
4.m1 * y1 = c (mod m2 / d)
最小整数解y1 = (y1 % m2 / d + m2 / d) % m2 / d
5.合并前2个方程,继续与后面的计算
x0 = m1 * y1 + b1已知
->x = x0 (mod lcm(m1,m2))
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
const int maxn = 1e5 + 5;//unknown
typedef long long ll;
ll a[maxn],r[maxn];
ll k;
void exgcd(ll a,ll &x,ll b,ll &y,ll &d)
{
if(b == 0){
d = a;
x = 1ll;y = 0;
return ;
}
exgcd(b, y, a % b, x, d);
y -= a / b * x;
}
bool solve(ll a1,ll r1,ll a2,ll r2)
{
ll x,y,d;
exgcd(a1, x, a2, y, d);
if((r2 - r1) % d) return false;
ll t = a2 / d;
x = (r2 - r1) / d * x;
x = (x % t + t) % t;
a[0] = a1 / d * a2;
r[0] = r1 + a1 * x;
return true;
}
int main()
{
while (scanf("%lld",&k) != EOF) {
for (int i = 0; i < k; i ++) {
scanf("%lld%lld",&a[i],&r[i]);
}
bool fg = 1;
for (int i = 1; i < k; i ++) {//每次计算(a[0],r[0]) 和 (a[i],r[i])
if(!solve(a[0],r[0],a[i],r[i])) {
fg = 0;break;
}
}
if(fg) printf("%lld\n",r[0]);
else printf("-1\n");
}
return 0;
}