Pagini recente » Cod sursa (job #2371368) | Cod sursa (job #1174109) | Cod sursa (job #1106895) | Cod sursa (job #767283) | Cod sursa (job #2028007)
#include <stdio.h>
#include <vector>
#define NMAX 8
using namespace std;
int n, p;
int ridicarea(int n, int p) {
if (p == 0)
return 1;
if (p == 1)
return n;
int current_p = 1;
int n_sqrt = n * n;
long n_current = 1;
while (current_p < p - 1) {
n_current *= n_sqrt;
current_p += 2;
}
if (p % 2 == 0) {
n_current *= n_sqrt;
} else {
n_current *= n;
}
return n_current;
}
int main(int argc, char const *argv[])
{
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
scanf("%d %d\n", &n, &p);
long n_p = ridicarea(n, p);
printf("%ld\n", n_p % 1999999973);
return 0;
}