Cod sursa(job #1176469)
Utilizator | Data | 26 aprilie 2014 10:04:05 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream in("inversmodular.in");
ofstream out("inversmodular.out");
long long p;
long long power(long long x,int n)
{
if(n==0)
return 1;
if(n==1)
return x%p;
if(n%2==0)
return (power((x*x)%p,n/2))%p;
return (x*power((x*x)%p,(n-1)/2))%p;
}
int main()
{
long long a,n;
in >> a >> n;
p=a;
out << (power(a,n-2))%p;
in.close();
out.close();
return 0;
}