Pagini recente » Istoria paginii runda/simulare-cartita-23 | Cod sursa (job #1127948) | Cod sursa (job #2382764) | Cod sursa (job #1545543) | Cod sursa (job #2034149)
#include <bits/stdc++.h>
#include <limits>
using namespace std;
typedef unsigned long long ll;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
ll fi(ll n)
{
ll prod=1,inloc=n,prodf=1,div=0;
for (int i=2;i*i<=n;++i)
{
if (inloc%i==0)
{
div++;
while (inloc%i==0&&inloc!=1)
{
inloc/=i; prod*=i;
}
prod/=i;
}
prodf*=prod*(i-1);
if (inloc==1) break;
}
return (div==0 ? n-1 : prodf);
}
ll exp_log(ll n,ll e,ll mod)
{
ll sol=1;
while (e!=0)
{
if (e%2==1) sol*=n%mod;
n*=n%mod;
e/=2;
}
return sol%mod;
}
int main()
{
ll a,n;
f>>a>>n;
g<<exp_log(a,n-2,n);
return 0;
}