Pagini recente » Clasament test101 | Cod sursa (job #1283465) | Cod sursa (job #1820739) | Cod sursa (job #1638621) | Cod sursa (job #1527788)
#include <iostream>
#include <cstdio>
using namespace std;
void euclid(int a, int b, int &d, int &x, int &y)
{
if (b == 0) {
d = 1;
x = 1;
y = 0;
}
else {
int x0, y0;
euclid(b, a%b, d, x0, y0);
x = y0;
y = x0 - y0*(a/b);
}
}
int getInvers(int a, int mod)
{
int d, x, y;
euclid(a, mod, d, x, y);
if (x < 0)
x += ((-x)/mod+1) * mod;
return x%mod;
}
int main()
{
freopen("inversmodular.in", "r", stdin);
freopen("inversmodular.out", "w", stdout);
int a, n;
scanf("%d %d", &a, &n);
int rez = getInvers(a, n);
printf("%d", rez);
return 0;
}