Pagini recente » Cod sursa (job #41399) | Cod sursa (job #1751991) | Cod sursa (job #318600) | Cod sursa (job #1754284) | Cod sursa (job #1141963)
#include <fstream>
#define pmax 32+5
#define MOD 1999999973
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
long long putere[pmax];
long long n, p;
long long ridicare(int p)
{
if (putere[p] == 0)
{
if (p == 0)
putere[p] = 0;
else if (p == 1)
putere[p] = n;
else if (p == 2)
putere[p] = n * n;
else
{
putere[p] = 1;
putere[p] *= ridicare(p / 2);
putere[p] *= ridicare(p / 2);
if (p % 2 == 1)
putere[p] *= ridicare(1);
}
}
return putere[p];
}
int main()
{
fin >> n >> p;
fout << ridicare(p) % MOD << '\n';
return 0;
}