Pagini recente » Cod sursa (job #1207893) | Istoria paginii runda/lasm_22.05.2017cl11/clasament | Cod sursa (job #2102237) | Cod sursa (job #1138199) | Cod sursa (job #2959207)
#include <bits/stdc++.h>
using namespace std;
typedef long long llong;
int pow(int n, int k, int m) {
llong r = 1, c = n;
while (k) {
if (k & 1) r = r * c % m;
c = c * c % m;
k >>= 1;
}
return r;
}
void solve() {
int a, n;
cin >> a >> n;
cout << pow(a, n - 2, n) << endl;
}
int main() {
#ifdef LOCAL
// freopen("file.in", "r", stdin);
#else
freopen("inversmodular.in", "r", stdin);
freopen("inversmodular.out", "w", stdout);
#endif
ios_base::sync_with_stdio(false), cin.tie(NULL);
solve();
}