Pagini recente » Cod sursa (job #1464547) | Cod sursa (job #2035917) | Istoria paginii runda/simulare_oji2011/clasament | Cod sursa (job #1215949) | Cod sursa (job #2028029)
#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;
int y = 1;
while (p > 1) {
if (p % 2 == 0) {
n *= n;
p = p / 2;
} else {
y *= n;
n *= n;
p = (p - 1) / 2;
}
}
return n * y;
}
int main(int argc, char const *argv[])
{
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
scanf("%d %d\n", &n, &p);
int n_p = ridicarea(n, p);
printf("%d\n", n_p % 1999999973);
return 0;
}