Pagini recente » Cod sursa (job #2294578) | Cod sursa (job #1974972) | Cod sursa (job #2774868) | Cod sursa (job #390688) | Cod sursa (job #1131379)
#include<stdio.h>
long long x, n, p, m;
long long put(long long n, long long p) {
if(p == 1) {
return n;
}
else {
if(p % 2 == 0) {
return put((n * n) % m, p / 2) % m;
}
else {
return (put((n * n) % m, p / 2) * n) % m;
}
}
}
int main () {
FILE *in, *out;
in = fopen("lgput.in", "r");
out = fopen("lgput.out", "w");
fscanf(in, "%d%d", &n, &p);
m = 1999999973;
x = put(n, p);
fprintf(out, "%lld\n", x);
fclose(in);
fclose(out);
return 0;
}