Cod sursa(job #2149709)
Utilizator | Data | 2 martie 2018 21:50:15 | |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream in("inversmodular.in");
ofstream out("inversmodular.out");
void gcd(long long int &x, long long int &y, int a, int b)
{
if (!b)
{
x = 1;
y = 0;
}
else
{
long long int x0, y0;
gcd(x0, y0, b, a%b);
x = y0;
y = x0 - y0 * (a / b);
}
}
int main()
{
int A, N;
long long inv, ins;
in >> A >> N;
gcd(inv, ins, A, N);
if (inv <= 0) inv += N;
out << inv;
return 0;
}