Cod sursa(job #228335)
| Utilizator | Data | 6 decembrie 2008 23:09:11 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 0 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <stdio.h>
#define ll long long
int A, N;
void euclid(ll &x, ll &y, int a, int b)
{
if (b==0)
x = 1, y = 0;
else
{
euclid(x,y,b,a%b);
ll aux=x;
x=y;
y=aux-y*(a/b);
}
}
int main()
{
ll nr=0,nrr;
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
scanf("%d %d",&A,&N);
euclid(nr,nrr,A,N);
if (nr<=0)
nr=N+nr%N;
printf("%lld",nr);
return 0;
}
