loj10196. 「一本通 6.1 练习 3」越狱

#include<cstdio>
#include<iostream>
using namespace std;
const int mod = 100003;
long long quickpow(long long a, long long b, long long p){
    long long res = 1;
    while(b){
        if(b & 1)    res = res * a % p;
        a = a * a % p;
        b >>= 1;
    }
    return res;
}
long long n, m;
int main(void){
    cin >> m >> n;
    cout << (mod + quickpow(m, n, mod) - ((m % mod) * quickpow(m - 1, n - 1, mod)) % mod) % mod << endl;
}