Pagini recente » Cod sursa (job #2106141) | Cod sursa (job #2556641) | Cod sursa (job #2500758) | Cod sursa (job #1431998) | Cod sursa (job #3313846)
#include <fstream>
#include <queue>
using namespace std;
ifstream cin("lgput.in");
ofstream cout("lgput.out");
const int dim= 1999999973;
long long n, p;
long long ex_rap(long long nr)
{
if(nr== 0)
return 1;
else
if(nr% 2== 0)
{
long long prod= ex_rap(nr/ 2);
return (1LL* prod* prod)% dim;
}
else
{
long long prod= ex_rap(nr/ 2);
return (1LL* prod* prod* n)% dim;
}
}
int main()
{
int i;
cin >> n>> p;
cout << ex_rap(p)% dim;
return 0;
}