Pagini recente » Cod sursa (job #1087542) | Cod sursa (job #1241968) | Cod sursa (job #1379392) | Cod sursa (job #1228881) | Cod sursa (job #2175400)
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef pair< int , int > PII;
ll a, n;
ll power(ll b, ll p){
int rs = 1;
for (; p; p >>= 1){
if (p & 1) rs = rs * b % n;
b *= b;
b %= n;
}
return rs;
}
ll inv_mod(ll base, ll modulo){
return power(base, modulo - 2);
}
int main(){
ifstream cin("inversmodular.in");
ofstream cout("inversmodular.out");
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> a >> n;
cout << inv_mod(a, n);
return 0;
}