Pagini recente » Cod sursa (job #2886938) | Cod sursa (job #226420) | Cod sursa (job #1064397) | Cod sursa (job #895128) | Cod sursa (job #2685115)
#include<bits/stdc++.h>
#define int long long
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int n,a,phi;
int phi_euler(int n)
{
int nn = n, ans = n;
for(int i = 2; i * i <= n; i ++)
{
if(nn % i == 0)
{
ans *= (i-1);
ans /= i;
while(nn % i == 0)
nn /= i;
}
}
if(nn != 1)
{
ans *= (nn-1);
ans /= nn;
}
return ans;
}
int lgput(int base,int exp)
{
int i;
int aux=base,ans=1;
for(i=1; i<=exp; i*=2)
{
if(i&exp)
ans=(1LL*ans*aux)%n;
aux=(1LL*aux*aux)%n;
}
return ans;
}
int32_t main()
{
fin>>a>>n;
phi=phi_euler(n);
fout<<lgput(a,phi-1);
return 0;
}