越狱——排列组合

HYSBZ - 1008

越狱

Time Limit: 1000MS

Memory Limit: 165888KB

64bit IO Format: %lld & %llu

[Submit]   [Go Back]   [Status]  

Description

监狱有连续编号为1...N的N个房间，每个房间关押一个犯人，有M种宗教，每个犯人可能信仰其中一种。如果相邻房间的犯人的宗教相同，就可能发生越狱，求有多少种状态可能发生越狱

Input

输入两个整数M，N.1<=M<=10^8,1<=N<=10^12

Output

可能越狱的状态数，模100003取余

Sample Input

2 3

Sample Output

6

Hint

 

6种状态为(000)(001)(011)(100)(110)(111)

 

Source

HNOI2008

 1 #include<iostream>
 2 
 3 #include<algorithm>
 4 #include<queue>
 5 #include<cstdio>
 6 #include<cstdlib>
 7 #include<cstring>
 8 #include<cmath>
 9 using namespace std;
10 #define sr(x) scanf("%d",&x)
11 #define sc(x) printf("%d",x)
12 #define hh printf("\n")
13 #define mod 100003
14 long long mi(long long m,long long n)
15 {
16     long long r=1,ss=m;
17     while(n!=0)
18     {
19         if(n&1)r*=ss;
20         ss*=ss;
21         ss%=mod;
22         r%=mod;
23         if(r==0)r=mod;
24         if(ss==0)ss=mod;
25         n>>=1;
26     }
27     return r;
28 }
29 
30 
31 int main()
32 {
33     long long m,n,x,y;
34     while(cin>>m>>n&&m+n!=0)
35     {
36         x=mi(m,n);
37         y=mi(m-1,n-1)*m;
38         y%=mod;
39         if(x<y)x+=mod;
40         cout<<x-y<<endl;
41     }
42     return 0;
43 }

 

转载于:https://www.cnblogs.com/lveternal/p/3413485.html