Pagini recente » Istoria paginii utilizator/mickai55 | Clasament Algoritmiada 2017 Runda 2 Juniori | brasov_challenge_2 | Diferente pentru problema/bazar intre reviziile 21 si 8 | Cod sursa (job #2178743)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fcin("lgput.in");
ofstream fcout("lgput.out");
int power(int x, int y)
{
if (y == 0)
return 1;
int d = power(x, y / 2);
if (y % 2 == 0)
return d * d;
return x * d * d;
}
int main()
{
int N, P;
fcin >> N >> P;
fcout << power(N, P) % 1999999973;
}