Cod sursa(job #2001492)
Utilizator | Data | 16 iulie 2017 21:25:39 | |
---|---|---|---|
Problema | Invers modular | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll lg_pow(ll x, ll p,ll mod){
ll r = 1;
while(p){
if(p % 2){
p--;
r = (r * x) % mod;
}
p /= 2;
x = (x * x) % mod;
}
return r;
}
ll invers_modular(ll x, ll mod){
return lg_pow(x, mod - 2, mod);
}
int main()
{
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
ll a,mod;
f >> a >> mod;
g << invers_modular(a,mod);
return 0;
}