1008: [HNOI2008]越狱
Time Limit: 1 Sec Memory Limit: 162 MBSubmit: 4516 Solved: 1922
[ Submit][ Status]
Description
监狱有连续编号为1...N的N个房间,每个房间关押一个犯人,有M种宗教,每个犯人可能信仰其中一种。如果相邻房间的犯人的宗教相同,就可能发生越狱,求有多少种状态可能发生越狱
Input
输入两个整数M,N.1<=M<=10^8,1<=N<=10^12
Output
可能越狱的状态数,模100003取余
Sample Input
Sample Output
HINT
6种状态为(000)(001)(011)(100)(110)(111)
c++
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
long long n,m,ans=0;
int pf(long long x1,long long x2)
{
int x=1;
while (x2>0)
{
if (x2%2==1) x=x*x1%100003;
x1=x1*x1%100003;
x2/=2;
}
return x;
}
int main()
{
scanf("%lld%lld",&m,&n);
int an;
ans=pf(m,n)+100003;
an=pf(m-1,n-1)*m%100003;
ans=(ans-an)%100003;
printf("%lld\n",ans);
return 0;
}