Pagini recente » Cod sursa (job #1259016) | Cod sursa (job #1894428) | Cod sursa (job #2431271) | Cod sursa (job #2852022) | Cod sursa (job #1481646)
#include <cstdio>
#include <cstdlib>
using namespace std;
const int mod = 1999999973;
int n, k;
int pow(int n, int k) {
if (k == 0)
return 1;
if (k == 1)
return n;
if (k % 2 == 1)
return 1LL * n * pow(n * n, k / 2) % mod;
else
return 1LL * pow(n * n, k / 2) % mod;
}
int main()
{
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
scanf("%d %d", &n, &k);
printf("%d", pow(n, k));
return 0;
}