Pagini recente » Cod sursa (job #2022079) | Cod sursa (job #1551619) | Cod sursa (job #1419043) | Cod sursa (job #2025912) | Cod sursa (job #3309962)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
const int MOD = 1999999973;
int nrApeluri = 0;
int powlg(long long N, long long P)
{
nrApeluri++;
if (P == 0)
return 1;
if (P % 2 == 1)
{
return powlg(N, P - 1) * N % MOD;
}
int radical = powlg(N, P / 2);
return 1LL * radical * radical % MOD;
}
int main()
{
long long n, p;
f >> n >> p;
g << powlg(n, p);
cout << nrApeluri;
return 0;
}