Pagini recente » Cod sursa (job #3248779) | Cod sursa (job #271711) | Cod sursa (job #621021) | Cod sursa (job #2764630) | Cod sursa (job #1879475)
#include <cstdio>
#define ll long long
int A, N;
void euclid(ll &x, ll &y, int a, int b)
{
if (!b)
x = 1, y = 0;
else
{
euclid(x, y, b, a % b);
ll aux = x;
x = y;
y = aux - y * (a / b);
}
}
int main()
{
ll inv = 0, ins;
freopen("inversmodular.in", "r", stdin);
freopen("inversmodular.out", "w", stdout);
scanf("%d %d", &A, &N);
euclid(inv, ins, A, N);
if (inv <= 0)
inv = N + inv % N;
printf("%lld", inv);
return 0;
}