Cod sursa(job #2369870)
Utilizator | Data | 6 martie 2019 09:34:53 | |
---|---|---|---|
Problema | Invers modular | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#define ll long long
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
ll n, MOD;
ll lgput(ll n, ll p)
{
ll ans=1;
while(p)
{
if(p&1) ans=(1LL*ans*n)%MOD;
n=(1ll*n*n)%MOD;
p >>= 1;
}
return ans;
}
int main()
{
f >> n >> MOD;
g << lgput(n, MOD-2);
return 0;
}