Pagini recente » Cod sursa (job #2928800) | Cod sursa (job #1599384) | Cod sursa (job #668136) | Cod sursa (job #1641777) | Cod sursa (job #1415631)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
long long a, n, sol, m ;
long long exp(long long x,long long p)
{
if(p<0) return exp(1/x,-p);
if(p==0) return 1;
if(p==1) return x;
if(p%2==0) return (exp((x*x)%n,p/2))%n;
if(p%2) return (x%n*exp((x*x)%n,(p-1)/2))%n;
}
int phi(int x)
{
int res = x;
for(int i = 2; i * i <= x; ++i) {
if(x % i == 0) {
res = res / i * (i - 1);
while(x % i == 0)
x /= i;
}
}
if(x != 1)
res = res / x * (x - 1);
return res;
}
int main()
{
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
fin>>a>>n;
long long n;
sol=phi(n);
sol=exp(a,sol-1);
fout << sol;
return 0;
}