Pagini recente » Cod sursa (job #1834352) | Cod sursa (job #725158) | Cod sursa (job #859289) | Cod sursa (job #356265) | Cod sursa (job #3125624)
#include <stdio.h>
#define ll long long
void recursiveGCD(ll& x, ll& y, int a, int b)
{
if (!b)
x = 1, y = 0;
else
{
recursiveGCD(x, y, b, a % b);
ll aux = x;
x = y;
y = aux - y * (a / b);
}
}
ll computeModularInverse(ll A,ll M) {
ll inv = 0, ins;
recursiveGCD(inv, ins, A, M);
if (inv <= 0)
inv = M + inv % M;
return inv;
}
int main()
{
ll A, M;
FILE* stream;
freopen_s(&stream, "inversmodular.in", "r", stdin);
freopen_s(&stream, "inversmodular.out", "w", stdout);
scanf_s("%lld %lld", &A, &M);
ll modularInverse = computeModularInverse(A, M);
printf("%lld\n", modularInverse);
return 0;
}