Pagini recente » Cod sursa (job #984493) | Cod sursa (job #2822733) | Cod sursa (job #2286340) | Cod sursa (job #2706932) | Cod sursa (job #2035884)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n;
ll exp_log(ll a, ll e,ll mod)
{
ll rez=1;
while(e!=0)
{
if(e%2==1)
{
rez=(rez*a)%mod;
}
a=(a*a)%mod;
e=e/2;
}
return rez%mod;
}
ll fi(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;
}
int main()
{
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
ll a;
f>>a>>n;
g<<exp_log(a,fi(n)-1,n);
return 0;
}