Pagini recente » Cod sursa (job #1122334) | Cod sursa (job #1863460) | Cod sursa (job #1113993) | Cod sursa (job #2476266) | Cod sursa (job #2862990)
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int t, a, b, c, d, x, y, n;
int euclid(int a, int b, int& x, int &y);
int main()
{
int i;
fin>>a>>n;
d=euclid(a,n,x,y);
while (x<0) x+=n;
fout<<x;
return 0;
}
int euclid(int a, int b, int& x, int &y)
{
int x1, y1;
if (b==0) {x=1; y=0; return a;}
int d=euclid(b, a%b, x1, y1);
x=y1;
y=x1-y1*(a/b);
return d;
}