Pagini recente » Cod sursa (job #371696) | Cod sursa (job #1566254) | Cod sursa (job #1164550) | Cod sursa (job #2393446) | Cod sursa (job #2173725)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int a,n;
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 invers(int a)
{
int d,x,y;
euclid(a,n,d,x,y);
if(x<0) x+=n;
return x;
}
int main()
{
fin>>a>>n;
fout<<invers(a);
return 0;
}