Cod sursa(job #1902571)
Utilizator | Data | 4 martie 2017 17:53:32 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int a, n;
int lgpow(int x, int p)
{
int r=1;
for(int i=0;(1<<i)<=p;i++)
{
if((1<<i)&p)
{
r*=x;
r%=n;
}
x*=x;
x%=n;
}
return r;
}
int main()
{
fin>>a>>n;
fout<<lgpow(a,n-2);
return 0;
}