Cod sursa(job #1342136)
| Utilizator | Data | 13 februarie 2015 16:01:37 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("inversmodular.in");
ofstream out("inversmodular.out");
unsigned long long a,n;
unsigned long long phi;
void citire()
{
in>>a>>n;
}
unsigned long long logPow(unsigned long long b, unsigned long long p)
{
unsigned long long ans=1;
while(p)
{
if(p%2==1)
ans=(ans*b)%n;
b=(b*b)%n;
p=p/2;
}
return ans;
}
void rezolvare()
{
phi=1;
out<<logPow(a,n-1-phi);
}
int main()
{
citire();
rezolvare();
return 0;
}
