Cod sursa(job #3298327)
Utilizator | Data | 28 mai 2025 20:05:08 | |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
void euclid(int a, int b, int &d, int &x, int &y){
if(b == 0){
d = a;
x = 1;
y = 0;
}
else{
int x0, y0;
euclid(b, a % b, d, x0, y0);
x = y0;
y = x0 - (a / b) * y0;
}
}
int modinv(int a, int n){
int x, y, d;
euclid(a, n, d, x, y);
while(x < 0)
x += n;
return x;
}
int main(){
int a, n;
fin >> a >> n;
fout << modinv(a, n);
fin.close();
fout.close();
return 0;
}