Cod sursa(job #2420042)
Utilizator | Ionescu Tiberiu Tibi55 | Data | 10 mai 2019 11:56:19 |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
void euclid(int a, int b, int &d, int &x, int &y)
{
if(b == 0)
{
x = 1;
y = 0;
d = a;
}
else
{
int x0, y0;
euclid(b, a % b, d, x0, y0);
x = y0;
y = x0 - (a / b) * y0;
}
}
int invmod(int a, int n)
{
int x, y, d;
euclid(a, n, d, x, y);
x %= n;
if(x < 0)
x += n;
return x;
}
int main()
{
int a, n;
f >> a >> n;
g << invmod(a, n);
return 0;
}