Pagini recente » Borderou de evaluare (job #1822621) | Borderou de evaluare (job #2425026) | Cod sursa (job #435203) | Cod sursa (job #2908043) | Cod sursa (job #3135501)
#include <stdio.h>
#define MOD 1999999973
#define ll long long
int pow(ll n, ll p) {
if(p == 0) return 1;
if(p % 2 == 0)
return pow(n*n % MOD, p/2) % MOD;
return (n * pow(n*n % MOD, (p-1)/2)) % MOD;
}
int main() {
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
ll n, p;
scanf("%lld %lld", &n, &p);
printf("%d", pow(n, p));
}