Cod sursa(job #2481340)
| Utilizator | Data | 26 octombrie 2019 19:23:31 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int n;
void euclid (int a, int b, int &x, int &y)
{
if (b == 0)
{
x = 1;
y = 0;
}
else
{
int x1, y1;
euclid(b, a%b, x1, y1);
x = y1;
y = x1 + a/b * y1;
x = (x+n)%n;
y = (y+n)%n;
}
}
int main()
{
// a*x = 1 (mod n)
// <=> x = 1/a (mod n)
int a;
fin >> a >> n;
int r, g;
euclid(a, n, r, g);
fout << r;
return 0;
}
