Pagini recente » Cod sursa (job #2329872) | Cod sursa (job #78162) | Cod sursa (job #2377214) | Cod sursa (job #3190412) | Cod sursa (job #3145038)
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
long long phi(long long n) {
long long fi = n;
if (n % 2 == 0) {
fi /= 2;
while (n % 2 == 0) {
n /= 2;
}
}
for (int d = 3; d * d <= n; d += 2) {
if (n % d == 0) {
fi = fi / d * (d - 1);
while (n % d == 0) {
n /= d;
}
}
}
if (n > 1) {
fi = fi / n * (n - 1);
}
return fi;
}
long long exponentiere(long long a, long long b, long long mod) {
if (b == 0) {
return 1;
} else if (b % 2) {
return exponentiere(a * a, b / 2, mod) * a % mod;
} else {
return exponentiere(a * a, b / 2, mod) % mod;
}
}
long long invers_modular(long long a, long long n) {
long long fi = phi(n);
return exponentiere(a, fi - 1, n);
}
int main() {
long long a, n;
fin >> a >> n;
long long inv_mod = invers_modular(a, n);
fout << inv_mod;
return 0;
}