Pagini recente » Cod sursa (job #2727146) | Cod sursa (job #248473) | Cod sursa (job #398026) | Cod sursa (job #2440227) | Cod sursa (job #1502954)
#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);
f=n;
s=n;
for(int i=1;i<=l;i++)
if(n%i==0) {while(s%i==0) s=s/i;f=f*(i-1)/i;}
if(s>1)
f=f*(s-1)*n;
printf("%d",ridic_putere(a,f-1));
return 0;
}