链接
HDU 1576 A/B - https://acm.hdu.edu.cn/showproblem.php?pid=1576
问题
求: ( A / B ) % 9973 , 其 中 : 0 ≤ A ≤ 9972 , 1 ≤ B ≤ 1 0 9 , ( B , 9973 ) = 1 (A / B)\,\, \%\,\,9973,其中: 0 \leq A\leq 9972,1 \leq B \leq 10^9,(B, 9973)=1 (A/B)%9973,其中:0≤A≤9972,1≤B≤109,(B,9973)=1
分析
- 设b为B的逆元,即 B ∗ b ≡ 1 ( m o d 9973 ) B*b \equiv 1 \,\, (mod \,\, 9973) B∗b≡1(mod9973),则 ( A / B ) % 9973 = ( A ∗ b ) % 9973 (A / B) \% 9973=(A*b) \% 9973 (A/B)%9973=(A∗b)%9973
- 扩展欧几里得 求 逆元,即方程 B ∗ b + 9973 ∗ y = 1 B*b+9973*y = 1 B∗b+9973∗y=1求解 b
代码
// hdu 1576 A/B
#include<bits/stdc++.h>
using namespace std;
#define MOD 9973
int A, B;
// ax + by = (a, b)
void ex_gcd(int a, int b, int &x, int &y){
// a = (a, 0) = (a, b)
if(b == 0){
x = 1, y = 0;
return;
}
// b(y+a/bx) + a%bx = (b, a%b)
ex_gcd(b, a%b, x, y);
int tmp = x;
x = y;
y = tmp - a/b*y;
}
int main(){
int t;
scanf("%d", &t);
while(t--){
scanf("%d%d", &A, &B);
int x, y;
ex_gcd(B, MOD, x, y);
printf("%d\n", A*(MOD+x%MOD)%MOD);
}
return 0;
}