Pagini recente » Cod sursa (job #1994673) | Cod sursa (job #1308885) | Cod sursa (job #1945468) | Cod sursa (job #3200879) | Cod sursa (job #2706868)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
long long A,N,EulerTotient;
int Phi(int K)
{
long long rez=1;
for(int i=2; i*i<=K; i++)
if(K%i==0)
{
rez=rez*(i-1);
K/=i;
while(rez%i==0)
{
rez*=i;
K/=i;
}
}
if(K!=1)
rez*=(K-1);
return rez;
}
long long logPow()
{
long long rez=1;
while(EulerTotient)
{
if(EulerTotient%2)
rez=(rez*A)%N;
A=(A*A)%N;
EulerTotient/=2;
}
return rez;
}
int main()
{
f>>A>>N;
EulerTotient=Phi(N)-1;
g<<logPow();
return 0;
}