Pagini recente » Cod sursa (job #515065) | Diferente pentru problema/cuplaj1 intre reviziile 30 si 31 | Cod sursa (job #1423074) | Cod sursa (job #2152359) | Cod sursa (job #3346399)
#include <fstream>
using namespace std;
int fi(int n)
{
int f = n, d = 2;
while (d * d <= n)
{
if (n % d == 0)
{
f /= d;
f *= (d - 1);
while (n % d == 0)
{
n /= d;
}
}
d++;
}
if (n != 1)
{
f /= n;
f *= (n - 1);
}
return f;
}
int putere(int a, int n, int mod)
{
int p = 1;
while (n != 0)
{
int cif = n % 2;
if (cif != 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 f = fi(n);
out << putere(a, f - 1, n) << "\n";
in.close();
out.close();
return 0;
}