Cod sursa(job #3229393)
Utilizator | Turcu David-Mihai TurcuDavid1 | Data | 15 mai 2024 19:42:47 |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
void Euclid(int a, int b, int &x, int &y) {
if(b == 0) {
x = 1;
y = 0;
} else {
int x0, y0;
Euclid(b, a % b, x0, y0);
x = y0;
y = x0 - (a / b) * y0;
}
}
int main() {
int a, n;
fin >> a >> n;
int x = 0, y = 0;
Euclid(a, n, x, y);
while (x < 0) {
x += n;
}
fout << x % n;
return 0;
}