Pagini recente » Cod sursa (job #1738087) | Cod sursa (job #1850820) | Cod sursa (job #1640496) | Monitorul de evaluare | Cod sursa (job #1415068)
#include <stdio.h>
#include <stdlib.h>
int put(int n,int p,int x)
{
if(p==0) return 1;
if(p==1) return n;
if(p%2==0) return(put(n*n%x,p/2,x))%x;
if(p%2==1) return(n*put(n*n%x,p/2,x))%x;
}
int euler(int n,int y)
{
int d,e,x,t=1;
d=2;
while(d*d<=n)
{
e=0;
while(n%d==0)
e++,n/=d;
if(e>0)
{
x=put(d,e-1,y);
t=t*x*(d-1)%y;
}
d++;
}
if(n>1)
t*=(n-1);
return t%y;
}
int main()
{
int a,n;
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
scanf("%d%d",&a,&n);
printf("%d\n",put(a,euler(n,n)-1,n)%n);
return 0;
}