Pagini recente » Cod sursa (job #360101) | Cod sursa (job #2269850) | Cod sursa (job #2119487) | Cod sursa (job #2480034) | Cod sursa (job #1202171)
#include <fstream>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
long long int n,p;
unsigned long long int pow(long long int n,long long int p,int MODULO);
int main()
{
fin>>n>>p;
fout<<pow(n,p,1999999973);
return 0;
}
unsigned long long int pow(long long int n,long long int p,int MODULO)
{
unsigned long long int result = 1;
while(p > 0)
{
if(p % 2 == 0)
{
n = (n * n) % MODULO;
p = p / 2;
}
else
{
result = (result * n) % MODULO;
p = p - 1;
}
}
return result;
}