Cod sursa(job #3264552)
| Utilizator | Data | 22 decembrie 2024 13:30:23 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
void euclid(int a, int b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
} else {
long long x1, y1;
euclid(b, a % b, x1, y1);
x = y1;
y = x1 - a / b * y1;
}
}
long long invers_modular(int a, int n) {
long long x, y;
euclid(a, n, x, y);
if (x < 0) {
x += n;
}
return x;
}
int main() {
int a, n;
fin >> a >> n;
fout << invers_modular(a, n);
return 0;
}
