算法
快速幂 $O(logk)$
C++ 代码
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
LL qmi(int a, int k, int p)
{
LL res = 1;
while (k)
{
if (k & 1) res = res * a % p;
a = a * (LL)a % p;
k >>= 1;
}
return res;
}
int main()
{
int n, m;
scanf("%d%d", &n, &m);
LL res = qmi(n, m, 233333);
printf("%lld\n", res);
return 0;
}