Pagini recente » Borderou de evaluare (job #695640) | Cod sursa (job #3345563) | Monitorul de evaluare | Cod sursa (job #752048) | Cod sursa (job #1815659)
#include <cstdio>
using namespace std;
const int MOD = 1999999973;
long long mypow(long long n, int p) {
long long ans;
ans = 1;
for( ; p; p = (p >> 1)) {
if(p & 1)
ans = (ans * n) % MOD;
n = (n * n) % MOD;
}
return ans;
}
int main() {
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
long long n;
int p;
scanf("%lld%d", &n, &p);
printf("%lld", mypow(n, p));
return 0;
}