Cod sursa(job #1512673)
| Utilizator | Data | 28 octombrie 2015 14:46:03 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
long long n, mod;
long long power(long long a, long long p)
{
if( !p )
return 1;
if( p % 2 )
return a * power(a, p - 1) % mod;
return ((power(a, p / 2) % mod) * (power(a, p / 2) % mod)) % mod;
}
int main()
{
fin >> n >> mod;
fout << power(n, mod - 2) % mod;
return 0;
}
