Pagini recente » Cod sursa (job #29069) | Cod sursa (job #3136051) | Cod sursa (job #3163973) | Cod sursa (job #1083803) | Cod sursa (job #2870816)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int a,n,ind;
int euler(int n)
{
int d=2,tot=n;
while(d*d<=n)
{
if(n%d==0)
{
while(n%d==0)
n/=d;
tot/=d;
tot*=d-1;
}
d++;
}
if(n>1)
{
tot/=n;
tot*=n-1;
}
return tot;
}
int pow(int x, int p, int MOD)
{
int rez=1;
while(p)
{
if(p&1)
rez=(rez*x)%MOD;
x=(x*x)%MOD;
p>>=1;
}
return rez;
}
int main()
{
fin >> a >> n;
ind=euler(n);
fout << pow(a,ind-1,n);
return 0;
}