Pagini recente » Cod sursa (job #2021191) | Cod sursa (job #1846983) | Cod sursa (job #3204008) | Cod sursa (job #1230179) | Cod sursa (job #3219487)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
const long long MOD = 1999999973ll;
long long power(long long base, long long exp);
int main()
{
long long n, p;
fin >> n >> p;
fout << power(n, p);
return 0;
}
long long power(long long base, long long exp)
{
if(base == 0)
return 0;
else if(base == 1)
return 1;
else if(exp == 0)
return 1;
else if(exp == 1)
return base;
long long result = 1, basePow = base;
while(exp)
{
if(exp & 1)
result = result * basePow % MOD;
basePow = basePow * basePow % MOD;
exp >>= 1;
}
return result;
}