HDU 5667 Sequence (矩阵快速幂+费马小定理)

 

Sequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2687    Accepted Submission(s): 896   Problem Description      Holion August will eat every thing he has found.      Now there are many foods,but he does not want to eat all of them at once,so he find a sequence. fn=⎧⎩⎨⎪⎪1,ab,abfcn−1fn−2,n=1n=2otherwise      He gives you 5 numbers n,a,b,c,p,and he will eat fn foods.But there are only p foods,so you should tell him fn mod p.     Input      The first line has a number,T,means testcase.      Each testcase has 5 numbers,including n,a,b,c,p in a line.     1≤T≤10,1≤n≤1018,1≤a,b,c≤109 ,p is a prime number,and p≤109+7 .     Output      Output one number for each case,which