#include <iostream>
using namespace std;
int exgcd(int a,int b,int &x,int &y)
{
if(b==0)
{
x=1;
y=0;
return a;
}
int r=exgcd(b,a%b,x,y);
int t=x;
x=y;
y=t-(a/b)*y;
return r;
}
int main()
{
int n,m,x,y;
while(cin>>m>>n)
{
exgcd(m,n,x,y);
while(x<0)
{
x+=n;
}
cout<<x<<endl;
}
return 0;
}
51nod 乘法逆元(扩展欧几里得)
最新推荐文章于 2022-02-26 16:52:46 发布