当你要计算两个数相乘取模并且相乘会爆long long还不能用__int128的时候,就需要用到快速乘了(n, k >= 0)。
原理就是把k二进制分解一下就完事了。
ll Slow_Mul(ll n, ll k, ll mod)
{
ll ans = 0;
while(k){
if(k & 1) ans = (ans + n) % mod;
k >>= 1;
n = (n + n) % mod;
}
return ans;
}
https://www.luogu.org/problemnew/show/P4777
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
void extgcd(ll a, ll b, ll &g, ll &x, ll &y)
{
if (b == 0) g = a, x = 1, y = 0;
else{
extgcd(b, a % b, g, y, x);
y -= (a / b) * x;
}
}
ll Slow_Mul(ll n, ll k, ll mod)
{
ll ans = 0;
while(k){
if(k & 1) ans = (ans + n) % mod;
k >>= 1;
n = (n + n) % mod;
}
return ans;
}
ll ma[maxn], mb[maxn], mm[maxn];
int main()
{
ios::sync_with_stdio(0); cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; ++i) cin >> ma[i] >> mb[i];
//x = k1a1 + b1 = k2a2 + b2
//k1a1 - k2a2 = b2 - b1
ll fb = mb[1], fa = ma[1], g, x, y, t, mi;
for (int i = 2; i <= n; ++i){
extgcd(fa, -ma[i], g, x, y);
t = (mb[i] - fb) / g;
//x ≡ b1 (mod a1)
//x ≡ k1a1 + b1 ≡ k2a2 + b2 (mod lcm(a1, a2))
mi = ma[i] / abs(g);
x = (x % mi + mi) % mi;
if (t < 0) x = Slow_Mul(x, t % mi + mi, mi);
else x = Slow_Mul(x, t, mi);
fb += x * fa;
fa = fa / abs(g) * ma[i];
fb %= fa;
}
cout << fb << endl;
return 0;
}
快速乘合并快速幂
ll Slow_Mul(ll n, ll k, ll mod)
{
ll ans = 0;
while(k){
if(k & 1) ans = (ans + n) % mod;
k >>= 1, n = (n + n) % mod;
}
return ans;
}
ll quickpow(ll x, ll k, ll mod)
{
ll res = 1;
while(k){
if(k & 1) res = Slow_Mul(res, x, mod);
k >>= 1, x = Slow_Mul(x, x, mod);
}
return res;
}