Pagini recente » Cod sursa (job #321298) | Cod sursa (job #1503364) | Cod sursa (job #870847) | Cod sursa (job #630364) | Cod sursa (job #342285)
Cod sursa(job #342285)
#include <iostream>
#include <cstdlib>
const long long mod = 1999999973;
using namespace std;
long pow(long long n, long long p) {
if (p == 0) return 1;
if (p == 1) return n;
if (p % 2 == 0) {
long long res = pow(n,p>>1) % mod;
return (res * res) % mod;
} else {
long long res = pow(n,p-1) % mod;
return (n * res ) % mod;
}
}
long long N,P;
int main() {
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%lld%lld",&N,&P);
printf("%lld",pow(N,P));
fclose(stdin);
fclose(stdout);
return 0;
}