Pagini recente » Cod sursa (job #616157) | Cod sursa (job #2615483) | Cod sursa (job #2649474) | Cod sursa (job #1125138)
/*solutie ce functioneaza doar cu N prim*/
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int A, M;
int lgput(int N, int P) {
int 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;
}