题意
给定2n个整数
a
1
,
a
2
,
…
,
a
n
a_1,a_2,…,a_n
a1,a2,…,an和
m
1
,
m
2
,
…
,
m
n
m_1,m_2,…,m_n
m1,m2,…,mn,
求一个最小的非负整x,满足 ∀i ∈ [ 1, n ],
x
≡
m
i
(
%
a
i
)
x ≡ m_i (\% \quad a_i)
x≡mi(%ai)
题解
参考题解
先浏览参考题解,再看下面图片中的题解。
对于第一组方程的解,其实m[1]即为最小的解,lcm = a[1].
也即让x的初始值为m[1], lcm的初始值为a[1]即可。
我自己的模板如下:
#include<cstdio>
#include<queue>
#include<set>
#include<cstdlib>
#include<string.h>
#include<string>
#include<iostream>
#include<cmath>
#include<map>
#include<algorithm>
#define endl "\n"
#define IOS ios::sync_with_stdio(0), cin.tie(0),cout.tie(0)
#define ft first
#define sd second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ll long long int
#define mt(a,b) memset(a, b, sizeof a)
//#define int long long
const double PI = acos(-1.0);
const int inf = 0x3f3f3f3f;
const int INF = 0x7fffffff;
using namespace std;
const int N = 2e5 + 7, M = 1e6 + 10;
ll a[100], m[100];
ll exgcd(ll a, ll b, ll& x, ll& y)
{
if (b == 0)
{
x = 1, y = 0; return a;
}
ll d = exgcd(b, a % b, x, y);
ll z = x; x = y; y = z - y * (a / b);
return d;
}
int main()
{
IOS;
ll n; cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i] >> m[i];
ll x = m[1], lcm = a[1];
int f = 1;
for (int i = 2; i <= n; i++)
{
ll c = m[i] - x;
ll t, y;
ll d = exgcd(lcm, a[i], t, y);
if (c % d)
{
cout << "-1\n";
return 0;
}
t *= c / d;
ll mod = a[i] / d;
t = (t % mod + mod) % mod;
x = x + t * lcm;
lcm = lcm / d * a[i];
}
cout << x << endl;
return 0;
}