Pagini recente » Cod sursa (job #2050722) | Cod sursa (job #1413629) | Cod sursa (job #2357728) | Cod sursa (job #2959752) | Cod sursa (job #1474673)
#include<cstdio>
using namespace std;
#define ll long long
int a,n;
ll x,y;
void euclid(int a,int b,ll &x,ll &y)
{
if(b==0)
{
x=1;
y=0;
}else
{
ll x0,y0;
euclid(b,a%b,x0,y0);
x=y0;
y=x0-(a/b)*y0;
}
}
int main()
{
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
scanf("%d%d",&a,&n);
euclid(a,n,x,y);
//while(x<0) x+=n;
printf("%d\n",x);
fclose(stdin);
fclose(stdout);
return 0;
}