Pagini recente » Cod sursa (job #2485765) | Cod sursa (job #3000948) | Cod sursa (job #83190) | Cod sursa (job #1909364) | Cod sursa (job #3256315)
#include <fstream>
using namespace std;
int indicatorul_euler(int n)
{
int e = n, d = 2;
while (d * d <= n)
{
if (n % d == 0)
{
e = e / d * (d - 1);
while (n % d == 0)
{
n /= d;
}
}
d++;
}
if (n != 1)
{
e = e / n * (n - 1);
}
return e;
}
int putere(int a, int n, int mod)
{
int p = 1;
while (n != 0)
{
if (n % 2 != 0)
{
p = ((long long)p * a) % mod;
}
a = ((long long)a * a) % mod;
n /= 2;
}
return p;
}
int main()
{
ifstream in("inversmodular.in");
ofstream out("inversmodular.out");
int a, n;
in >> a >> n;
int fi = indicatorul_euler(n);
out << putere(a, fi - 1, n) << "\n";
in.close();
out.close();
return 0;
}