Pagini recente » Cod sursa (job #118677) | Cod sursa (job #891801) | Cod sursa (job #1741150) | Cod sursa (job #2962305) | Cod sursa (job #2930672)
#include <iostream>
#include <fstream>
using namespace std;
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 main()
{
ifstream in("inversmodular.in");
ofstream out("inversmodular.out");
int n, a, b, c, x, y, i, d;
in>>a>>n;
euclid(a, n, d, x, y);
if(x<0){
while(x<0)
x+=n;
}
out<<x;
return 0;
}