Pagini recente » Cod sursa (job #903032) | Cod sursa (job #1164922) | Cod sursa (job #800683) | Cod sursa (job #1135301) | Cod sursa (job #1902946)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int a, n, d, x, y;
void euclid(int a, int b, int &d, int &x, int &y)
{
if(!b)
{
d=a;
x=1;
y=0;
}
else
{
int x0, y0;
euclid(b, a%b, d, x0, y0);
x=y0;
y=x0-(a/b)*y0;
}
}
int main()
{
fin>>a>>n;
euclid(a,n,d,x,y);
while(x<0)
x+=n;
fout<<x;
return 0;
}