Cod sursa(job #1258026)
Utilizator | Data | 8 noiembrie 2014 13:21:41 | |
---|---|---|---|
Problema | Invers modular | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
using namespace std;
ifstream in("inversmodular.in");
ofstream out("inversmodular.out");
long long pow(int h,int p)
{
int i,k=1;
for(i=1;i<=h;i++)
k=k*p;
return k;
}
int main()
{
long long a,n;
in>>a>>n;
out<<pow(a,n-2)%n;
return 0;
}