Pagini recente » Borderou de evaluare (job #509217) | Cod sursa (job #447934) | Borderou de evaluare (job #3255315) | Cod sursa (job #2374906) | Cod sursa (job #2864238)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
int n, p;
const int mod = 1999999973;
int LgPow(int a, int n)
{
int p = 1;
while(n)
{
if(n % 2 == 1)
p = (1ll * p * a) % mod;
a = (1ll * a * a) % mod;
n /= 2;
}
return p;
}
int main()
{
fin >> n >> p;
fout << LgPow(n, p);
return 0;
}