Pagini recente » Cod sursa (job #2273407) | Cod sursa (job #2749534) | Cod sursa (job #572761) | Cod sursa (job #1635702) | Cod sursa (job #2327130)
#include <bits/stdc++.h>
#define MOD 666013
using namespace std;
typedef long long ll;
ll getphi(ll nr)
{
ll cur = nr;
for(ll i = 2;i * i <= nr; ++i)
{
if (nr % i == 0)
{
while(nr % i == 0)nr /= i;
cur = (cur / i) * (i - 1);
}
}
if (nr != 1) cur = cur / nr * (nr - 1);
return cur;
}
ll mod;
ll mypow(ll a,ll p)
{
ll rez=1;
while(p!=0)
{
if(p%2==1)
rez=(rez*a)%mod;
a=(a*a)%mod;
p/=2;
}
return rez;
}
int main()
{
ll a,n,f;
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
cin>>a>>n;
f=getphi(n);
mod=n;
cout<<mypow(a,f-1)<<'\n';
return 0;
}