Pagini recente » Cod sursa (job #2865693) | Cod sursa (job #2251879) | Cod sursa (job #2055666) | Cod sursa (job #233140) | Cod sursa (job #1333559)
#include <fstream>
using namespace std;
ifstream cin("inversmodular.in");
ofstream cout("inversmodular.out");
int m,n,x,y,d;
void euclid(int a,int b,int *d,int *x,int *y)
{
int x0,y0;
if (!b)
{
*x=1;
*y=0;
*d=a;
}
else
{
euclid(b,a%b,d,&x0,&y0);
*x=y0;
*y=x0-a/b*y0;
}
}
int main()
{
int i,j;
cin>>m>>n;
euclid(m,n,&d,&x,&y);
while (x<0)
x+=n;
cout<<x;
}