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