#include<iostream>
#include<cstdio>
#define LL long long
using namespace std;
LL k;
LL ksm(LL x,LL y)
{
if(y==0)
return 1;
if(y==1)
return x;
LL a=ksm(x,y/2)%k;
if(y%2)
return ((a*a)%k*x%k)%k;
else
return (a*a)%k;
}
int main()
{
LL n,m;
scanf("%lld%lld",&m,&n);
k=100003;
LL ans=ksm(m%k,n)%k;
LL b=(ksm((m-1)%k,n-1)%k*m)%k;
while(ans<b)
ans+=k;
printf("%lld",ans-b);
return 0;
}
bzoj 1008 越狱 快速幂
最新推荐文章于 2018-01-08 16:57:05 发布