Pagini recente » Cod sursa (job #2149345) | Cod sursa (job #2913316) | Cod sursa (job #2342553) | Cod sursa (job #113231) | Cod sursa (job #3280357)
#include <iostream>
#include <fstream>
using namespace std;
#define ll long long
const ll MOD = 1999999973;
ll pow(ll n, ll p)
{
if (p == 0)
{
return 1;
}
if (p % 2 == 0)
{
ll x = pow(n, p / 2) % MOD;
return x * x % MOD;
}
else
{
return n * (pow(n, p - 1) % MOD) % MOD;
}
}
int main()
{
ifstream fin("lgput.in");
ofstream fout("lgput.out");
ll n = 0;
ll p = 0;
fin >> n >> p;
fout << pow(n, p) % MOD;
}