矩阵快速幂hdu3306Another kind of Fibonacci

hahaAll

于 2016-10-26 12:34:35 发布

阅读量441

点赞数 1

分类专栏：快速幂

本文链接：https://blog.csdn.net/hahaAll/article/details/52933096

版权

快速幂专栏收录该内容

7 篇文章 0 订阅

订阅专栏

Another kind of Fibonacci

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2370 Accepted Submission(s): 945

Problem Description

As we all known , the Fibonacci series : F(0) = 1, F(1) = 1, F(N) = F(N - 1) + F(N - 2) (N >= 2).Now we define another kind of Fibonacci : A(0) = 1 , A(1) = 1 , A(N) = X * A(N - 1) + Y * A(N - 2) (N >= 2).And we want to Calculate S(N) , S(N) = A(0) ² +A(1) ²+……+A(n) ².

Input

There are several test cases.
Each test case will contain three integers , N, X , Y .
N : 2<= N <= 2 ³¹ – 1
X : 2<= X <= 2 ³¹– 1
Y : 2<= Y <= 2 ³¹ – 1

Output

For each test case , output the answer of S(n).If the answer is too big , divide it by 10007 and give me the reminder.

Sample Input

Sample Output

思路：主要能推出递推式就好办了……还是比较好写的

但是这个题卡常数吧，，用long long 会TLE…

#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
#include 
       
       
         using namespace std; typedef long long LL; const int N = 6; int k; int MOD; struct Mat { int mat[N][N]; Mat operator *(const Mat &a)const { Mat tmp; for(int i = 0; i < k; i++) for(int j = 0; j < k; j++) { tmp.mat[i][j] = 0; for(int l = 0; l < k; l++) tmp.mat[i][j] += mat[i][l] * a.mat[l][j] % MOD; tmp.mat[i][j] %= MOD; } return tmp; } }; int quick(int n,int x,int y) { if(n == 1)return 2; if(n == 0)return 1; n--; x %= MOD; y %= MOD; Mat ans; memset(ans.mat,0,sizeof(ans.mat)); for(int i = 0; i < k; i++)ans.mat[i][i] = 1; Mat tmp; memset(tmp.mat,0,sizeof(tmp.mat)); tmp.mat[0][0] = tmp.mat[5][0] = x*x%MOD; tmp.mat[0][1] = tmp.mat[5][1] = y*y%MOD; tmp.mat[0][2] = tmp.mat[5][2] = 2*x*y%MOD; tmp.mat[2][0] = tmp.mat[3][3] = x; tmp.mat[2][2] = tmp.mat[3][4] = y; tmp.mat[1][0] = tmp.mat[4][3] = tmp.mat[5][5] = 1; while(n) { if(n & 1)ans = ans * tmp; tmp = tmp * tmp; n >>= 1; } int res = 0; for(int i = 0; i < 4; i++) res = (res + ans.mat[5][i] % MOD) % MOD; res = res + (ans.mat[5][5] * 2) % MOD; return res % MOD; } int main() { int x,n,y; k = 6; MOD = 10007; while(~scanf("%d%d%d",&n,&x,&y)) { printf("%d\n",quick(n,x,y)); } return 0; }