Pagini recente » Cod sursa (job #176734) | Borderou de evaluare (job #3193808) | Cod sursa (job #710431) | Cod sursa (job #1019725) | Cod sursa (job #2798804)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1999999973;
int n, p;
inline ll plog(ll BAZA, const ll EXPONENT) {
ll R = 1;
BAZA %= MOD;
for(ll i = 1; i <= EXPONENT; i <<= 1) {
if(i & EXPONENT) R = R * BAZA % MOD;
BAZA = BAZA * BAZA % MOD;
}
return R;
}
int main()
{
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
scanf("%d%d", &n, &p), printf("%lld", plog(n, p));
return 0;
}