Pagini recente » Cod sursa (job #434097) | Cod sursa (job #638992) | Cod sursa (job #1089550) | Cod sursa (job #2201272) | Cod sursa (job #146929)
Cod sursa(job #146929)
#include <stdio.h>
#include <string.h>
#include <math.h>
long n_max = 10001, m = 2000000000, i, n, p;
long long sol;
int main() {
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%ld %ld", &n, &p);
sol = 1;
for (i = 0; (1<<i) <= p; ++i) {
if ( ((1 << i) & p) > 0)
sol = (sol * n) % m;
n = (n * n) % m;
}
printf("%lld\n", sol);
}