HDU 2855（数论，构造矩阵+矩阵乘法）

 

Fibonacci Check-up

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 324    Accepted Submission(s): 183

Problem Description

Every ALPC has his own alpc-number just like alpc12, alpc55, alpc62 etc.
As more and more fresh man join us. How to number them? And how to avoid their alpc-number conflicted?
Of course, we can number them one by one, but that’s too bored! So ALPCs use another method called Fibonacci Check-up in spite of collision.

First you should multiply all digit of your studying number to get a number n (maybe huge).
Then use Fibonacci Check-up!
Fibonacci sequence is well-known to everyone. People define Fibonacci sequence as follows: F(0) = 0, F(1) = 1. F(n) = F(n-1) + F(n-2), n>=2. It’s easy for us to calculate F(n) mod m.
But in this method we make the problem has more challenge. We calculate the formula , is the combination number. The answer mod m (the total number of alpc team members) is just your alpc-number.

 

 

Input

First line is the testcase T.
Following T lines, each line is two integers n, m ( 0<= n <= 10^9, 1 <= m <= 30000 )

 

 

Output

Output the alpc-number.

 

 

Sample Input

  
  

   
   2
1 30000
2 30000
  
  

 

 

Sample Output

  
  

   
   1
3
  
  

/************************************************************************ 刚刚开始的时候不知道怎么推出公式，于是就想试试打表能不能找出规律 1 3 8 21 55 144 377 987 2584 6765 17711 46368 终于发现了一个规律： f[n]=3*f[n-1]-f[n-2] 于是乎，就可以构造矩阵来解了 ************************************************************************/ #include <iostream> using namespace std; #define N 2 #define ll __int64 struct Mat { int martix[N][N]; }; Mat res,q,tp,tp1; int MOD; Mat Martix_Mul(Mat &a,Mat &b) { int i,j,k; Mat c; for (i=0;i<N;i++) { for (j=0;j<N;j++) { c.martix[i][j]=0; for (k=0;k<N;k++) { if(a.martix[i][k] && b.martix[k][j]) c.martix[i][j]=(c.martix[i][j]+(a.martix[i][k]*b.martix[k][j]))%MOD; } } } return c; } void er_fun(ll x) { tp=res; tp1=q; while (x) { if(x&1) tp=Martix_Mul(tp,tp1); tp1=Martix_Mul(tp1,tp1); x>>=1; } } int main() { ll n,sum; int t,i,j; for (i=0;i<N;i++) { for (j=0;j<N;j++) { res.martix[i][j]=(i==j); } } q.martix[0][0]=3; q.martix[0][1]=-1; q.martix[1][0]=1; q.martix[1][1]=0; scanf("%d",&t); while(t--) { scanf("%I64d %d",&n,&MOD); if(n==0) {printf("0/n");continue;} if(n==1) {printf("%d/n",1%MOD);continue;} if(n==2) {printf("%d/n",3%MOD);continue;} er_fun(n-2); sum=0; sum=(sum+tp.martix[0][0]*3)%MOD; if(sum<0) sum+=MOD; sum=(sum+tp.martix[0][1]*1)%MOD; if(sum<0) sum+=MOD; printf("%I64d/n",sum); } return 0; }