Cod sursa(job #2032951)
Utilizator | Data | 5 octombrie 2017 21:50:56 | |
---|---|---|---|
Problema | Invers modular | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream in ("inversmodular.in");
ofstream out ("inversmodular.out");
long long p(long long b,long long e,long long mod)
{
long long rez=1;
long long put=b;
for(long long i=0;i<32;i++,put=(put*put)%mod)
if((1<<i)&e)
rez=(rez*put)%mod;
return rez;
}
int main()
{
int n,m;
in>>n>>m;
out<<p(n,m-2,m);
return 0;
}