Pagini recente » Cod sursa (job #3145001) | Cod sursa (job #108426) | Cod sursa (job #1673947) | Cod sursa (job #767909) | Cod sursa (job #3227565)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
void euclid(int a, int b, int &d, int &x, int &y)
{
if(b==0)
{
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()
{
int a,n,d,x=0,y=0;
fin >> a >> n;
euclid(a,n,d,x,y);
while(x<0)
x=x+n;
fout << x%n;
return 0;
}