Pagini recente » Cod sursa (job #1608514) | Cod sursa (job #989205) | Cod sursa (job #1223394) | Cod sursa (job #315009) | Cod sursa (job #3295888)
#include <bits/stdc++.h>
using namespace std;
int n;
void euclid(int a, int b, int& x1, int& y1)
{
if(b==0)
{
x1=1;
y1=1;
}
else
{
int x2, y2;
euclid(b, a%b, x2, y2);
x1=y2;
y1=(x2-a/b*y2)%n;
}
}
int main()
{
ifstream cin("inversmodular.in");
ofstream cout("inversmodular.out");
int a;
cin >> a >> n;
int x1, y1;
euclid(a, n, x1, y1);
if(x1<0) x1+=n;
cout << x1;
return 0;
}