Cod sursa(job #2033879)
Utilizator | Data | 7 octombrie 2017 11:30:09 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream in("inversmodular.in");
ofstream out("inversmodular.out");
long long nr(long long a, long long c, long long mod)
{
long long cnt=1;
while(a>0)
{
if(a%2==0)
cnt*=a%mod;
a*=a%mod;
c/=2;
}
return cnt;
}
int main()
{
int a,n,p=1;
in>>a>>n;
out<<nr(a,n-2,n);
return 0;
}