Pagini recente » Cod sursa (job #1776085) | Cod sursa (job #1776079) | Cod sursa (job #135059) | Cod sursa (job #2483945) | Cod sursa (job #146948)
Cod sursa(job #146948)
#include <stdio.h>
#include <string.h>
#include <math.h>
const int n_max = 10001;
const int m = 1999999973;
long long i, n, p, a;
long long sol;
int main() {
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%lld %lld", &n, &p);
sol = 1;
a = n;
for (i = 0; (1<<i) <= p; ++i) {
if ( ((1 << i) & p) > 0)
sol = (sol * a) % m;
a = (a * a) % m;
}
printf("%lld\n", sol);
}