Pagini recente » Cod sursa (job #2868557) | Cod sursa (job #1767892) | Cod sursa (job #1680935) | Cod sursa (job #2327294) | Cod sursa (job #2120466)
#include <iostream>
#include <stdio.h>
using namespace std;
long long lgput (long long n, long long p) {
int mod = 1999999973;
long long rez = 1;
while (p > 0) {
if (p % 2 == 0) {
n = (n % mod) * n % mod;
p = p / 2;
}
else {
rez = rez * (n % mod) % mod;
p--;
}
}
return rez;
}
int main() {
freopen ("lgput.in", "r", stdin);
freopen ("lgput.out", "w", stdout);
long long n, p;
scanf ("%lld%lld", &n, &p);
printf ("%lld", lgput (n, p));
return 0;
}