Pagini recente » Cod sursa (job #1843225) | Cod sursa (job #2952146) | Cod sursa (job #2202591) | Cod sursa (job #1079294) | Cod sursa (job #1502953)
#include <cstdio>
#include <cmath>
using namespace std;
int a,n;
int ridic_putere(int a,int f)
{
int b=a;
int rez=1;
for(int i=1;i<=f;i<<=1)
{
if(f & i) rez=(1LL*rez*b)%n;
b=(1LL*b*b)%n;
}
return rez;
}
int v[50000];
int vaz[50000];
int main()
{
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
int c,j,f,l=0,s;
scanf("%d%d",&a,&n);
c=sqrt(n);
for(int i=2;i<=c;i++)
if(vaz[i]==0) {j=i*i;l++;v[l]=i;
while(j<=c)
{
vaz[j]=1;
j+=i;
}
}
f=n;
s=n;
for(int i=1;i<=l;i++)
if(n%v[i]==0) {while(s%v[i]==0) s=s/v[i];f=f*(v[i]-1)/v[i];}
if(s>1)
f=f*(s-1)*n;
printf("%d",ridic_putere(a,f-1));
return 0;
}