Cod sursa(job #1051831)
Utilizator | Dragos Gegea gegead | Data | 10 decembrie 2013 17:00:58 |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include<cstdio>
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()
{
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
int a,n,d,x,y,i;
scanf("%d%d",&a,&n);
euclid(a,n,&d,&x,&y);
while(x<0)
{
x+=n;
}
printf("%d",x);
return 0;
}