Pagini recente » Cod sursa (job #3286562) | Cod sursa (job #2650646) | Cod sursa (job #1091423) | Cod sursa (job #239884) | Cod sursa (job #228335)
Cod sursa(job #228335)
#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;
}