Pagini recente » Cod sursa (job #2268636) | Cod sursa (job #3308049) | Cod sursa (job #3311155) | Diferente pentru problema/treesmen intre reviziile 2 si 1 | Cod sursa (job #3309958)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
const int MOD = 1999999973;
int powlg(long long N, long long P)
{
if (P == 0)
return 1;
if (P % 2 == 1)
{
return 1LL * powlg(N, P / 2) * powlg(N, P / 2) % MOD * N % MOD;
}
return 1LL * powlg(N, P / 2) * powlg(N, P / 2) % MOD;
}
int main()
{
long long n, p;
f >> n >> p;
g << powlg(n, p);
return 0;
}