Cod sursa(job #1512693)
| Utilizator | Data | 28 octombrie 2015 15:18:51 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 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)
{
long long ans = 1;
while(p)
{
if( p & 1 )
ans = (ans * a) % mod;
a = (a % mod) * (a % mod) % mod;
p >>= 1;
}
return ans;
}
int main()
{
fin >> n >> mod;
fout << power(n, mod - 2) % mod;
return 0;
}
