题目链接:
http://acm.hdu.edu.cn/showproblem.php?pid=1019
题目大意:
中文题
题解:
设(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
AC代码:
#include <iostream>
#include <cstdio>
using namespace std;
void exgcd(int a, int b, int& x, int& y)
{
if(b == 0)
{
x = 1,y = 0;
return ;
}
exgcd(b,a%b,x,y);
int tmp = x;
x = y;
y = tmp - a/b*y;
}
int main()
{
int T,x1,x2,x,y;
cin >> T;
while(T--)
{
cin >> x1 >> x2;
exgcd(x2,9973,x,y);
x = x*x1;
x=(x%9973 + 9973) % 9973;//将x转为最小的正整数
cout << x <<endl;
}
return 0;
}