Cod sursa(job #2029781)
Utilizator | Data | 30 septembrie 2017 13:53:10 | |
---|---|---|---|
Problema | Invers modular | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream in ("inversmodular.in");
ofstream out ("inversmodular.out");
long long expow(long long b,long long e,long long mod)
{
long long ans=1;
for(int bit=0;(1ll<<bit)<=e;bit++)
{
if(e&(1ll<<bit))
ans=ans*b%mod;
b=b*b%mod;
}
return ans;
}
int main()
{
long long a,n;
in>>a>>n;
out<<expow(a,n-2,n);
return 0;
}