Cod sursa(job #1902926)
| Utilizator | Data | 4 martie 2017 20:57:31 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a, n;
int euclid(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
} else {
int x0, y0;
int d = euclid(b, a % b, x0, y0);
x = y0;
y = x0 - (a / b) * y0;
return d;
}
}
int main(int argc, const char * argv[]) {
ifstream cin("inversmodular.in");
ofstream cout("inversmodular.out");
cin >> a >> n;
int x, y;
euclid(n, a, x, y);
while (y < 0) {
y += n;
}
cout << y;
return 0;
}
