Pagini recente » Cod sursa (job #99410) | Cod sursa (job #763149) | Cod sursa (job #2659605) | Cod sursa (job #1782422) | Cod sursa (job #2539772)
#include <iostream>
#include<fstream>
#include<math.h>
using namespace std;
long long int exponentiererapida(int a,int n,int mod){
long long int p=1;
while(n>0){
if(n%2==0){
a=(a*a)%mod;
n=n/2;
}
else{
p=(p*a)%mod;
n=n-1;
}
}
return p%mod;
}
long long phi(long long x)
{ long long p=1;
for(long long i=2;i*i<=x;i++)
{ if(x%i!=0)
continue;
long long e=0,k=1;
while(x%i==0)
x/=i,e++,k*=i;
k/=i;
p=(i-1)*k;
}
if(x!=1)
p*=(x-1);
return p;
}
int main()
{
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
int a,n;
f>>a>>n;
g<<exponentiererapida(a,phi(n)-1,n);
return 0;
}