記得取模時對答案的處理

 1 #include<bits/stdc++.h>
 2 #define ll long long
 3 using namespace std;
 4 
 5 const ll M=100003;
 6 
 7 ll qpow(ll a,ll b) {
 8     ll ans=1;
 9     while(b) {
10         if(b&1)ans=ans*a%M;
11         a=a*a%M,b>>=1;
12     }
13     return ans;
14 }
15 
16
 
 ll m,n,ans;
17 int main() {
18     cin>>m>>n;
19     if(n==1) ans=0;
20     else ans=qpow(m,n)-(m*qpow(m-1,n-1))%M;
21     cout<<(ans+M)%M<<endl;
22     return 0;
23 }

bzoj 1008