Pagini recente » Cod sursa (job #23814) | Istoria paginii utilizator/alexbraileanu | Borderou de evaluare (job #1961041) | Cod sursa (job #3209749)
#include <iostream>
#include <cmath>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
long long n, k;
long long expo(long long a, long long p)
{
if (p == 0)
{
return 1;
}
long long nr = expo(a, p / 2);;
if (p % 2 == 1)
{
return a % k * nr * nr % k;
}
return nr * nr % k;
}
int main()
{
f >> n >> k;
g << expo(n, k - 2);
}