快速幂

 推荐文章

模板

#include 
using namespace std;
const int mod = 100003;
typedef long long ll;
int solve1(ll a, ll b)
{
    ll ra = 1;
    while (b > 0)
    {
        if (b & 1)
            ra = (ra * a) % mod;
        b >>= 1;
        a = (a * a) % mod;
    }
    return ra;
}
int main()
{
    ll n, m;
    cin >> m >> n;
    ll a = solve1(m, n);// m ^ n
    cout<<a;

    return 0;
}