Pagini recente » Cod sursa (job #590405) | Cod sursa (job #2125781) | Cod sursa (job #2640653) | Cod sursa (job #752226) | Cod sursa (job #2883935)
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int n,m;
int eulerind(int n)
{
long long rez=n;
int d=2;
while(d*d<=n)
{
if(n%d==0) rez=rez*(d-1)/d;
while(n%d==0) n/=d;
d++;
}
if(n>1)
{
rez=rez*(n-1)/n;
}
return rez;
}
long long exp(int b, int e, int mod)
{
if(e==0) return 1;
if(e%2==1) return (b*exp(b,e-1,mod))%mod;
else
{
long long x=exp(b,e/2,mod);
return (x*x)%mod;
}
}
int main()
{
fin >> n >> m;
fout << exp(n,eulerind(m)-1,m);
return 0;
}