Pagini recente » Cod sursa (job #839803) | Cod sursa (job #423987) | Cod sursa (job #92104) | Cod sursa (job #3134520) | Cod sursa (job #1689592)
#include <iostream>
#include <cstdio>
using namespace std;
void euclid(int a, int b, int &x, int &y, int &d)
{
if (b == 0) {
d = a;
x = 1;
y = 0;
}
else {
int x0, y0;
euclid(b, a%b, x0, y0, d);
x = y0;
y = x0 - y0*(a/b);
}
}
int invers(int a, int n)
{
int x, y, d;
euclid(a, n, x, y, d);
while (x < 0) x += n;
return x % n;
}
int main()
{
freopen("inversmodular.in", "r", stdin);
freopen("inversmodular.out", "w", stdout);
int a, n;
scanf("%d %d", &a, &n);
int rez = invers(a, n);
printf("%d", rez);
return 0;
}