思路:设(A/B)%9973 = K, 则A/B = k + 9973x (x未知), 因此A = kB + 9973xB,
又A%9973 = n, 所以kB%9973 = n, 故kB = n + 9973y (y未知)
故(k/n)B +(-y/n)*9973 = gcd(B,9973) = 1
扩展欧几里得 求出k/n, 再乘以个n,记得取模
#include <iostream>
#include <cstdio>
using namespace std;
const int MOD = 9973;
void exgcd(int a, int b, int &x, int &y)
{
if(!b)
{
x = 1, y = 0;
return ;
}
exgcd(b, a%b, x, y);
int r = x;
x = y;
y = r - (a/b)*y;
}
int main()
{
int n, b, t, x, y;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&b);
exgcd(b, MOD, x, y);
x = (x%MOD+MOD) % MOD;
printf("%d\n",(x*n)%MOD);
}
return 0;
}