Pagini recente » Cod sursa (job #3245501) | Cod sursa (job #601352) | Cod sursa (job #1494658) | Cod sursa (job #640348) | Cod sursa (job #1902926)
#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;
}