HYSBZ - 1008 越狱（组合数学）

#include <cstdio>

using namespace std;
const int mod = 1e5+3;

int ks(long long n,long long k)
{
    long long s=1;
    while(k)
    {
        if(k%2)
            s = s*n%mod;
        n = n*n%mod;
        k /= 2;
    }
    return s;
}

int main()
{
    long long m,n;
    while(scanf("%lld %lld",&m,&n)!=EOF)
    {
        long long tot = ks(m,n);
        long long ret = m*ks(m-1,n-1)%mod;
        long long ans = (tot-ret+mod)%mod;
        printf("%lld\n",ans);
    }
}