Cod sursa(job #1563188)
Utilizator | Data | 5 ianuarie 2016 18:53:33 | |
---|---|---|---|
Problema | Invers modular | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <iostream>
using namespace std;
typedef long long ll;
ll a, n, ans = 1;
int main() {
ifstream cin("inversmodular.in");
ofstream cout("inversmodular.out");
cin >> a >> n;
ll phi = n - 1;
ll put = phi - 1;
while (put > 0) {
if (put % 2 == 1) {
ans = (ans * a) % n;
}
a = (a * a) % n;
put /= 2;
}
cout << ans;
return 0;
}