Pagini recente » Cod sursa (job #1091959) | Cod sursa (job #701118) | Cod sursa (job #999523) | Cod sursa (job #1959670) | Cod sursa (job #3167910)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
long long A,N;
/**
long long po(long long a, long long b)
{
if(b==0) return 1;
if(b%2==1)
return (a * po(a*a,b/2))%N;
return po(a*a,b/2)%N;
}
*/
long long mod;
long long lgput(long long a, long long b)
{
long long p = 1;
while (b)
{
if (b & 1)
{
p *= a;
p %= mod;
b--;
}
a *= a;
a %= mod;
b = b >> 1;
}
return p;
}
long long phi(long long n)
{
long long 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()
{
fin>>A>>N;
long long ph=phi(N)-1;
mod=N;
fout<<lgput(A,ph);
return 0;
}