Cod sursa(job #1257871)
Utilizator | Data | 8 noiembrie 2014 11:55:51 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp | Status | done |
Runda | cls6ichbsim1 | Marime | 0.32 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("inversmodular.in");
ofstream out("inversmodular.out");
int pow(int n,int p)
{
int i,k=1;
for(i=1;i<=n;i++)
k=k*p;
return k;
}
int main()
{
long long n,a,i;
in>>a>>n;
i=pow(a,n-2);
out<<i%n;
return 0;
}