Pagini recente » Cod sursa (job #2545902) | Cod sursa (job #1271408) | Cod sursa (job #2928971) | Cod sursa (job #817387) | Cod sursa (job #2290507)
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
typedef long long Int;
const Int MOD = 1999999973LL;
inline Int produs(Int x,Int y){return x*y%MOD;}
inline Int putere(int b,int e)
{
if(e==0)
return 1;
Int r=putere(b,e/2);
r=r*r%MOD;
if(e%2)
r=r*b%MOD;
return r;
}
Int n,a,m,sol,phi,p,q;
int main()
{
fin>>a>>n;
m=n;
phi=1;
for(p=2;p*p<=n;p++)
if(m%p==0)
{
m/=p;phi*=p-1;
while(m%p==0)
{
m/=p;
phi*=p;
}
}
if(m>1)
phi*=m-1;
sol=putere(a,phi-1);
fout<<sol;
return 0;
}