Pagini recente » Cod sursa (job #401847) | Cod sursa (job #2741044) | Cod sursa (job #678684) | Cod sursa (job #2264719) | Cod sursa (job #2436097)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
const int MOD = 1999999973;
long long epq(long long n, long long p)
{
if(p == 1)
{
return n % MOD;
}
if(p % 2 == 0)
{
return epq((n*n) % MOD, p>>1)%MOD;
}
else
{
return(n * epq((n*n) % MOD, p>>1) % MOD);
}
}
int main()
{
long long n, p;
fin>>n>>p;
fout<<epq(n, p)%MOD;
return 0;
}