Pagini recente » Sandbox (cutiuţa cu năsip) | Cod sursa (job #2138744) | Cod sursa (job #652233) | Cod sursa (job #1109742) | Cod sursa (job #3178484)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int eu(int n)
{
int d=2,p=0,rasp=1,c=n;
while(d*d<=n)
{
p=0;
while(n%d==0)
{
p++;
n/=d;
}
if(p)
{
rasp*=(1-(1/d));
}
d++;
}
if(n>1)
{
rasp*=(1-(1/n));
}
return rasp*c;
}
int main()
{
long long int a,x,n,p=1;
fin>>a>>n;
x=eu(n)-1;
while(x>0)
{
if(x%2==1)
{
p=(p*a)%n;
}
a=(a*a)%n;
x/=2;
}
fout<<p%n;
return 0;
}