Pagini recente » Cod sursa (job #575129) | Cod sursa (job #2834087) | Cod sursa (job #2378041) | Cod sursa (job #3004546) | Cod sursa (job #2289426)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
long long a,n;
long long ridicare(long long baza,long long exp){
long long rez=1;
while(exp!=0){
if(exp%2==0){
baza=(baza*baza)%n;
exp/=2;
}
else{
rez=(rez*baza)%n;
exp--;
}
}
return rez;
}
bool IsPrime(){
for(long long i=2;i<=n/2;i++){
if(n%i==0)return false;
}
return true;
}
int main()
{
fin>>a>>n;
if(IsPrime()){
fout<<ridicare(a,n-2)%n;
}
else{
long long phi=n,cn=n,d=2;
while(cn!=1){
bool ok=false;
while(cn%d==0){
cn/=d;
ok=true;
}
if(ok){
phi=phi-phi/d;
}
d++;
}
fout<<ridicare(a,phi-1)%n;
}
return 0;
}