Pagini recente » Cod sursa (job #1292973) | Cod sursa (job #2055693) | Monitorul de evaluare | Cod sursa (job #340795) | Cod sursa (job #2431366)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
const int num =1999999973;
long long pow(long long n,long long p)
{
int r = 1;
while(p)
{
if(p%2==1)
r= r*n % num;
n= n*n % num;
p=p/2;
}
return r;
}
int main()
{
long long n,p;
fin>>n>>p;
fout<<pow(n,p)<<'\n';
fin.close();
fout.close();
return 0;
}