Cod sursa(job #1609367)
Utilizator | Data | 22 februarie 2016 19:20:15 | |
---|---|---|---|
Problema | Invers modular | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
long long a , n;
long long mod;
long long exp ( int n , int p )
{
if ( p == 0 )
return 1;
else if ( p%2 == 1) return (n * (exp((n%mod*n%mod)%mod,p/2))) %mod;
else return exp((n%mod*n%mod)%mod,p/2)%mod;
}
int main()
{
f >> a >> n;
mod = n;
g << exp(a,n-2);
return 0;
}