BZOJ 1008 [HNOI2008]越狱

题目链接：https://www.lydsy.com/JudgeOnline/problem.php?id=1008

解题思路：

越狱情况 = 总方案数m^n - 所有不越狱的情况m×(m-1)^n-1

求多次方用快速幂

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#define mod 100003
#define ll long long

using namespace std;

ll fast_power(ll a,ll b)
{
    if (a==1) return 1;
    ll ans = 1;
    while (b){
        if (b&1) ans = ans*a%mod;
        b>>=1;
        a = a*a%mod;
    }
    return ans;
}

int main()
{
    ll n,m;
    while (~scanf("%lld %lld",&m,&n)){
        ll All = fast_power(m,n);//printf("All=%lld\n",All);
        ll right = m*fast_power(m-1,n-1)%mod;//printf("right=%lld\n",right);
        ll ans = (All-right+mod)%mod;
        printf("%lld\n",ans);
    }
    return 0;
}

总结：正着不好求反着求