Pagini recente » Cod sursa (job #866951) | Cod sursa (job #137601) | Cod sursa (job #2210646) | Cod sursa (job #1373634) | Cod sursa (job #3194633)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
/*int phi(int n)
{
int 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;
}*/long long x,y;
long long pw(long long a,long long b)
{
if(b==0)return 1;
if(b%2==1)return a*pw(a,b-1)%y;
long long P=pw(a,b/2)%y;
return P*P%y;
}
int main()
{
fin>>x>>y;
fout<<pw(x,y-2)%y;
return 0;
}