Cod sursa(job #2029929)
Utilizator | Data | 30 septembrie 2017 17:38:16 | |
---|---|---|---|
Problema | Invers modular | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
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;
}
ifstream in("inversmodular.in");
ofstream out("inversmodular.out");
int main()
{
int a,n;
in>>a>>n;
out<<expow(a,n-2,n);
return 0;
}