Pagini recente » Cod sursa (job #2461801) | Cod sursa (job #2208716) | Cod sursa (job #1476225) | Cod sursa (job #436177) | Cod sursa (job #2576208)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
long long P(int a, int n)
{
long long p=1;
while(n)
{
if(n%2==1)
p=p*a;
a=a*a;
n/=2;
}
return p;
}
int Phi(int n)
{
int r=n, d=2;
while(n>1)
{
if(n%d==0)
{
r=r/d*(d-1);
while(n%d==0)
n/=d;
}
d++;
if(d*d>n)
d=n;
}
return r;
}
int main()
{
int a, n;
fin >> a >> n;
// Inversul moduelar a lui a
long long x = P(a,Phi(n)-1);
fout << x%n;
return 0;
}