Pagini recente » Cod sursa (job #1140700) | Cod sursa (job #1416835) | Cod sursa (job #2422779) | Cod sursa (job #2058516) | Cod sursa (job #2123690)
#include <cstdio>
using namespace std;
int a,n,d,p;
int main()
{
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
scanf("%d %d\n",&a,&n);
p=1;
for(d=2;d*d<=n;d++)
if(!(n%d))
{
while(n%d==0)
n/=d;
p*=(d-1);
if(n==1)
break;
}
if(n!=1)
p=n-1;
p--;
d=1;
while(p)
{
if(p%2==1)
d=(d*a)%n;
a=(a*a)%n;
p/=2;
}
printf("%d\n",d);
return 0;
}