Cod sursa(job #1393196)
Utilizator | Data | 19 martie 2015 10:28:34 | |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
int euclid(int a, int b, int &x, int &y)
{
if (b==0)
{
x=1;
y=0;
return a;
}
else
{
int x0,y0,d;
d=euclid(b,a%b,x0,y0);
x=y0;
y=x0-(a/b)*y0;
return a;
}
}
int a,n,x,y;
int main()
{
f>>a>>n;
euclid(a,n,x,y);
while (x<=0) x+=n;
g<<x;
return 0;
}