Pagini recente » Cod sursa (job #459068) | Cod sursa (job #1512972) | Cod sursa (job #2109712) | Cod sursa (job #1767975) | Cod sursa (job #1726749)
#include <bits/stdc++.h>
long long power(long long n, long long e) {
if (e == 0) return 1;
long long y = 1;
while (e > 1) {
if (e % 2 == 0) {
n = (n * n) % 1999999973;
e = e / 2;
}
else {
y = (y * n) % 1999999973;
n = (n * n) % 1999999973;
e = (e - 1) / 2;
}
}
return ((n * y) % 1999999973);
}
int main() {
FILE *fin = fopen("lgput.in", "r");
FILE *fout = fopen("lgput.out", "w");
long long n, e;
fscanf(fin, "%lld %lld", &n, &e);
long long x = power(n, e);
fprintf(fout, "%lld\n", x);
fclose(fin);
fclose(fout);
}