快速幂板子题

费劲千辛万苦让我把暴力卡掉了哈哈哈哈哈哈 大水题

#include <bits/stdc++.h>
#define NN INT_MAX-1
#define NNN INT_MIN+1
#define ll long long
using namespace std;
ll MOD = 114514;
ll qpow(ll a,ll b)
{
ll t = a % MOD,res = 1;
while(b)
{
if(b & 1)
res = res * t % MOD;
t = t * t % MOD;
b >>= 1;
}
return res;
}
int main()
{
int x, y;
cin >> x >> y;
cout << qpow(x, y) << endl;
return 0;
}