Pagini recente » Cod sursa (job #2470821) | Cod sursa (job #194189) | Cod sursa (job #2091724) | Cod sursa (job #1829362) | Cod sursa (job #315846)
Cod sursa(job #315846)
#include <stdio.h>
#define ll long long
int A, N;
void gcd(ll &x, ll &y, int a, int b)
{
if (!b)
x = 1, y = 0;
else
{
gcd(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);
gcd(inv, ins, A, N);
if (inv <= 0)
inv = N + inv % N;
printf("%lld\n", inv);
return 0;
}