Pagini recente » Cod sursa (job #3236805) | Cod sursa (job #2916436) | Cod sursa (job #2055469) | Cod sursa (job #2877236) | Cod sursa (job #3125630)
#include <stdio.h>
#include <fstream>
#define ll long long
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
void recursiveGCD(ll& x, ll& y, ll a, ll b)
{
if (!b)
x = 1, y = 0;
else
{
recursiveGCD(x, y, b, a % b);
ll aux = x;
x = y;
y = aux - y * (a / b);
}
}
/*
* Compute B such that A*B = 1 % N
*/
ll computeModularInverse(ll A,ll N) {
ll inv = 0, ins;
recursiveGCD(inv, ins, A, N);
if (inv <= 0)
inv = N + inv % N;
return inv;
}
int main()
{
ios_base::sync_with_stdio(false);
ll A, N;
fin >> A >> N;
ll modularInverse = computeModularInverse(A, N);
fout << modularInverse;
return 0;
}