BZOJ 1008 越狱

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

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 const int mod=100003;
 4 typedef long long ll;
 5 inline ll read()
 6 {
 7     ll x=0,f=1;
 8     char ch=getchar();
 9     while(ch<'0'||ch>'9')
10     {
11         if(ch=='-')
12             f=-1;
13         ch=getchar();
14     }
15     while(ch>='0'&&ch<='9')
16     {
17         x=x*10+ch-'0';
18         ch=getchar();
19     }
20     return x*f;
21 }
22 inline ll qpow(ll x,ll p)
23 {
24     ll ret=1;
25     for(;p;p>>=1,x=x*x%mod)
26     {
27         if(p&1)
28             ret=ret*x%mod;
29     }
30     return ret;
31 }
32 ll m,n;
33 int main()
34 {
35     m=read();
36     n=read();
37     ll a=qpow(m,n);
38     ll b=b=((m%mod)*qpow(m-1,n-1))%mod;
39     ll ans=(a+mod-b)%mod;
40     cout<<ans<<endl;
41     return 0;
42 }