Pagini recente » Cod sursa (job #802434) | Cod sursa (job #704267) | Borderou de evaluare (job #200812) | Cod sursa (job #1713823) | Cod sursa (job #2366180)
#include <fstream>
using namespace std;
int GetPhi(int X)
{
int phi = X;
for(int div = 2; div * div <= X; div++)
if(X % div == 0)
{
phi = (phi / div) * (div - 1);
while(X % div == 0)
X /= div;
}
if(X != 1)
phi = (phi / X) * (X - 1);
return phi;
}
int RidPut(int base, int exp, int mod)
{
int ans = 1;
int aux = base % mod;
for(int i = 1; i <= exp; i <<= 1)
{
if(i & exp)
ans = 1LL * ans * aux % mod;
aux = 1LL * aux * aux % mod;
}
return ans;
}
int main()
{
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int A, N;
fin >> A >> N;
int phi = GetPhi(N);
fout << RidPut(A, phi - 1, N);
return 0;
}