Pagini recente » Cod sursa (job #881171) | Cod sursa (job #110630) | Cod sursa (job #491093) | Cod sursa (job #2858242) | Cod sursa (job #3143730)
#include <bits/stdc++.h>
#define int long long
using namespace std;
int mod;
int lgpow(int base, int exponent)
{
int result = 1;
while (exponent)
{
if (exponent % 2)
result = result * base % mod;
base = base * base % mod;
exponent /= 2;
}
return result;
}
signed main()
{
#ifndef TEST
freopen("inversmodular.in", "r", stdin);
freopen("inversmodular.out", "w", stdout);
#endif
ios_base :: sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a;
cin >> a >> mod;
cout << lgpow(a, mod - 2) % mod;
return 0;
}