Cod sursa(job #1857636)
Utilizator | pruna stefan stefanvd | Data | 26 ianuarie 2017 14:59:55 |
---|---|---|---|
Problema | Invers modular | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
long long ipow(long long base, long long exp,long long p)
{
long long result = 1;
while (exp)
{
if (exp&1)
result = (result * base)%p;
exp>>=1;
base = (base * base)%p;
}
return result;
}
int main()
{
long long q;
long long inv=0,ins;
long long a,b,p;
f>>a>>p;
g<<ipow(a,p-2,p);
return 0;
}