转化为ax+by=c的形式,其中b=9973
#include <iostream>
using namespace std;
int x,y;
int exgcd(int a,int b)
{
if(b==0)
{
x=1;
y=0;
return a;
}
int r=exgcd(b,a%b);
int t=x;
x=y;
y=t-a/b*y;
return r;
}
int main()
{
int T,n,b;
cin>>T;
while(T--)
{
cin>>n>>b;
int gcd=exgcd(b,9973);
x=x*n;
x=(x%9973+9973)%9973;//取最小正x
cout<<x<<endl;
}
return 0;
}