Pagini recente » Cod sursa (job #695772) | Cod sursa (job #1428429) | Cod sursa (job #2203024) | Cod sursa (job #1475024) | Cod sursa (job #1318363)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("inversmodular.in");
ofstream cout("inversmodular.out");
int n, m;
int sol(int nr)
{
int c=nr;
for (int i=2; i*i<=nr; ++i)
if (nr%i == 0)
{
while (nr % i ==0) nr/=i;
c=(c/i)*(i-1);
}
if (nr!=1) c=c/ nr * (nr-1);
return c;
}
int main()
{
cin>>n>>m;
int p=sol(m)-1;
int nr=n;
int c=1;
while (p)
{
if (p%2)
{
c=c*nr %m;
--p;
}
else
{
nr*=nr;
p/=2;
}
}
cout<<c;
return 0;
}