Cod sursa(job #1125222)
| Utilizator | Data | 26 februarie 2014 16:25:01 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
/*solutie ce functioneaza doar cu M prim*/
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int A, M;
long long lgput(long long N, int P) {
long long Sol = 1;
int MO = P + 2;
while (P) {
if (P % 2)
Sol = (Sol * N) % MO;
N = (N * N) % MO;
P /= 2;
}
return Sol;
}
int main() {
fin >> A >> M;
fout << lgput(A, M - 2);
fin.close();
fout.close();
return 0;
}
