1290. 越狱

Posted 2021-11-04 幽殇默

https://www.acwing.com/problem/content/1292/

#include<bits/stdc++.h>
using namespace std;
typedef long long int LL;
const int mod=100003;
LL quick_mi(LL a,LL b,LL p)
{
    LL sum=1;
    while(b)
    {
        if(b&1) sum=sum*a%p;
        b>>=1;
        a=(a*a)%p;
    }
    return sum%p;
}
int main(void)
{
    LL n,m; cin>>m>>n;
    cout<<(quick_mi(m,n,mod)-m*quick_mi(m-1,n-1,mod)%mod+mod)%mod;
    return 0;
}