Pagini recente » Cod sursa (job #2254689) | Cod sursa (job #573059) | Cod sursa (job #830847) | Cod sursa (job #1166775) | Cod sursa (job #1162795)
#include<cstdio>
using namespace std;
int a,b,n,i,phi,N,r;
int main()
{
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
scanf("%d%d",&a,&n); phi=1; N=n;
for(i=2;i*i<=n;i++)
if(n%i==0)
{
while(n%i==0) n/=i,phi*=i;
phi/=i; phi*=(i-1);
}
if(n>1) phi*=(n-1);
b=phi-1; r=1;
for(long long i=1;i<=(1LL*b);i<<=1)
{
if(i&b) r=(1LL*r*a)%N;
a=(1LL*a*a)%N;
}
printf("%d\n",r);
return 0;
}