HDU6172-Array Challenge

Array Challenge

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 153428/153428 K (Java/Others)
Total Submission(s): 60 Accepted Submission(s): 24

Problem Description
There’s an array that is generated by following rule.
h0=2,h1=3,h2=6,hn=4hn−1+17hn−2−12hn−3−16
And let us define two arrays bnandan as below.
bn=3hn+1hn+9hn+1hn−1+9h2n+27hnhn−1−18hn+1−126hn−81hn−1+192(n>0)
an=bn+4n
Now, you have to print ⌊√(an)⌋ , n>1.
Your answer could be very large so print the answer modular 1000000007.

Input
The first line of input contains T (1 <= T <= 1000) , the number of test cases.
Each test case contains one integer n (1 < n <= 1015) in one line.

Output
For each test case print ⌊√(a_n )⌋ modular 1000000007.

Sample Input
3
4
7
9

Sample Output
1255
324725
13185773

Source
2017 Multi-University Training Contest - Team 10

题目大意：求$\lfloor \sqrt{a_n} \rfloor \; mod\; (1e^9+7)$
解题思路：设$f_n=\lfloor \sqrt{a_n} \rfloor$，写出前几项$f_2=31,f_3=197,f_4=1255,f_5=7997,f_6=50959$
又$h_3=35,h_4=190,h_5=1267,h_6=7862$
可以发现$f_n$跟$h_n$的递推结果很像，
于是根据$h_n=4h_{n-1}+17h_{n-2}-12h_{n-3}-16$的递推关系猜测$f_n=4f_{n-1}+17f_{n-2}-12f_{n-3}$
是一个线性递推式，用矩阵快速幂。

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
typedef long long LL;
const int MOD=1e9+7;

struct matrix
{
    LL v[3][3];
    matrix(){memset(v,0,sizeof(v));}
};

matrix M,E,ans;//E为单位矩阵

void Init()//初始化
{
    for(int i=0;i<3;i++) E.v[i][i]=1;
    M.v[0][0]=4;M.v[0][1]=17;M.v[0][2]=-12;
    M.v[1][0]=1;M.v[1][1]=0;M.v[1][2]=0;
    M.v[2][0]=0;M.v[2][1]=1;M.v[2][2]=0;
}

matrix mul(matrix a,matrix b)//矩阵乘法
{
    matrix c;
    for(int i=0;i<3;i++)
        for(int j=0;j<3;j++)
            for(int k=0;k<3;k++)
                c.v[i][j]=(c.v[i][j]%MOD+a.v[i][k]*b.v[k][j]%MOD+MOD)%MOD;
    return c;
}

matrix pow(matrix p,LL k)//矩阵快速幂
{
    matrix tmp=E;
    while(k)
    {
        if(k&1)
        {
            tmp=mul(tmp,p);
            k--;
        }
        k>>=1;
        p=mul(p,p);
    }
    return tmp;
}

int main()
{
    LL n;
    Init();
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%lld",&n);
        if(n==2) printf("31\n");
        else if(n==3) printf("197\n");
        else if(n==4) printf("1255\n");
        else
        {
            ans=pow(M,n-4);
            LL res=(ans.v[0][0]*1255%MOD+ans.v[0][1]*197%MOD+ans.v[0][2]*31%MOD+MOD)%MOD;
            printf("%lld\n",res);
        }
    }
    return 0;
}