Pagini recente » Cod sursa (job #1156015) | Cod sursa (job #2530694) | Cod sursa (job #2845378) | Cod sursa (job #799863)
Cod sursa(job #799863)
#include<cstdio>
#include<algorithm>
using namespace std;
void euclid(int a,int b,int *x,int *y)
{
if(b==0)
{
*x=1;
*y=0;
return;
}
int x0,y0;
euclid(b,a%b,&x0,&y0);
*x=y0;
*y=x0-(a/b)*y0;
}
int main()
{
int a,n,x,y;
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
scanf("%d%d",&a,&n);
euclid(a,n,&x,&y);
for(;x<0;x+=n);
printf("%d",x);
return 0;
}