Pagini recente » Cod sursa (job #181158) | Cod sursa (job #2337797) | Cod sursa (job #186549) | Cod sursa (job #956803) | Cod sursa (job #1502960)
#include <cstdio>
#include <cmath>
using namespace std;
int a,n;
int ridic_putere(int a,int f)
{
int rez=1;
for(long long i=1;i<=f;i<<=1)
{
if(f & i) rez=(1LL*rez*a)%n;
a=(1LL*a*a)%n;
}
return rez;
}
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);
f=n;
s=n;
for(int i=2;i<=c;i++)
if(n%i==0)
{
while(s%i==0) s=s/i;
f=(f/i)*(i-1);
}
if(s>1) f=(f/s)*(s-1);
printf("%d",ridic_putere(a,f-1));
return 0;
}