Cod sursa(job #2029798)
Utilizator | Andrei Croitoru AndreiCroitoru | Data | 30 septembrie 2017 14:18:17 |
---|---|---|---|
Problema | Invers modular | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream in("inversmodular.in");
ofstream out("inversmodular.out");
long long lgput(long long n,long long p,long long mod)
{
long long r=1,c;
while(p!=1)
{
if(p%2==0)
{
p=p/2;
n=(n*n)%mod;
}
else
{
p=p-1;
r=(r*n)%mod;
}
}
n=n*r;
c=n%mod;
return c;
}
int main()
{
long long n,p;
in>>n>>p;
out<<lgput(n,p-2,p);
return 0;
}