Pagini recente » Cod sursa (job #2398878) | Cod sursa (job #535993) | Cod sursa (job #2093260) | Cod sursa (job #235651) | Cod sursa (job #3161836)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int Mod = 1e9 + 7;
ll mul(ll a, ll b, int mod = Mod)
{
return (a * b) % mod;
}
ll power(ll base, ll exp, int mod = Mod)
{
ll ret = 1;
while(exp)
{
if(exp & 1)
ret = mul(ret, base, mod);
base = mul(base, base, mod);
exp >>= 1;
}
return ret;
}
int main()
{
freopen("inversmodular.in", "r", stdin);
freopen("inversmodular.out", "w", stdout);
ll a, n;
cin >> a >> n;
cout << power(a, n - 2, n);
return 0;
}