Recursive sequence（矩阵快速幂）

Recursive sequence

Farmer John likes to play mathematics games with his N cows. Recently, they are attracted by recursive sequences. In each turn, the cows would stand in a line, while John writes two positive numbers a and b on a blackboard. And then, the cows would say their identity number one by one. The first cow says the first number a and the second says the second number b. After that, the i-th cow says the sum of twice the (i-2)-th number, the (i-1)-th number, and i4. Now, you need to write a program to calculate the number of the N-th cow in order to check if John’s cows can make it right.
input
The first line of input contains an integer t, the number of test cases. t test cases follow.
Each case contains only one line with three numbers N, a and b where N,a,b < 231 as described above.
Output
For each test case, output the number of the N-th cow. This number might be very large, so you need to output it modulo 2147493647.
Sample Input

2
3 1 2
4 1 10

Sample Output

85
369

Hint

In the first case, the third number is 85 = 21十2十3^4.
In the second case, the third number is 93 = 21十1*10十3^4 and the fourth number is 369 = 2 * 10 十 93 十 4^4.

思路：
找到规律然后写出板子，然后带入算好的矩阵。规律和矩阵很难算。当然规律提示给了是：a[i+1]=2a[i-1]+a[i]+(i+1)^4， 然后表示（i+1)^4。这个用二项式展开这个就行了（其实就是算起来很难算很麻烦）。如图:

---

完整代码：

#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
const ll MOD=2147493647ULL;			//在常数后面增加一个U标识，因为是long long型的所以加一个ULL（我因为这个点WA了一次）
const int maxn=7;					//不加会报一个warning，但运行时样例是对的
#define mod(x) ((x)%MOD)

struct mat
{
    ll m[maxn][maxn];
}unit;

mat operator *(mat a,mat b)
{
    mat ret;
    ll x;
    for(int i=0;i<maxn;i++)
    {
        for(int j=0;j<maxn;j++)
        {
            x=0;
            for(int k=0;k<maxn;k++)
            {
                x+=mod((ll)a.m[i][k]*b.m[k][j]);
            }
            ret.m[i][j]=mod(x);
        }
    }
    return ret;
}

void init_unit()
{
    for(int i=0;i<maxn;i++)
    {
        unit.m[i][i]=1;
    }
    return ;
}

mat pow_mat(mat a,ll n)
{
    mat ret=unit;
    while(n)
    {
        if(n&1)
        {
            ret=ret*a;
        }
        a=a*a;
        n>>=1;
    }
    return ret;
}

int main()
{
    int t;
    cin>>t;
    init_unit();
    ll A,B,n;
    while(t--)
    {
        cin>>n>>A>>B;
        if(n==1)
        {
            cout<<A<<endl;
        }
        else if(n==2)
        {
            cout<<B<<endl;
        }
        else
        {
            mat a,b;

            b.m[0][0]=1;b.m[0][1]=1;b.m[0][2]=0;b.m[0][3]=0;b.m[0][4]=0;b.m[0][5]=0;b.m[0][6]=0;
            b.m[1][0]=2;b.m[1][1]=0;b.m[1][2]=0;b.m[1][3]=0;b.m[1][4]=0;b.m[1][5]=0;b.m[1][6]=0;
            b.m[2][0]=1;b.m[2][1]=0;b.m[2][2]=1;b.m[2][3]=0;b.m[2][4]=0;b.m[2][5]=0;b.m[2][6]=0;
            b.m[3][0]=4;b.m[3][1]=0;b.m[3][2]=4;b.m[3][3]=1;b.m[3][4]=0;b.m[3][5]=0;b.m[3][6]=0;
            b.m[4][0]=6;b.m[4][1]=0;b.m[4][2]=6;b.m[4][3]=3;b.m[4][4]=1;b.m[4][5]=0;b.m[4][6]=0;
            b.m[5][0]=4;b.m[5][1]=0;b.m[5][2]=4;b.m[5][3]=3;b.m[5][4]=2;b.m[5][5]=1;b.m[5][6]=0;
            b.m[6][0]=1;b.m[6][1]=0;b.m[6][2]=1;b.m[6][3]=1;b.m[6][4]=1;b.m[6][5]=1;b.m[6][6]=1;

            a.m[0][0]=B;a.m[0][1]=A;a.m[0][2]=16;a.m[0][3]=8;a.m[0][4]=4;a.m[0][5]=2;a.m[0][6]=1;
            b = pow_mat(b,n-2);
            a=a*b;
            cout<<mod(a.m[0][0])<<endl;
        }
    }
    return 0;
}

---

小知识：（注意）C语言中常量值默认是一个32位的有符号整型数。由于2394967295无法用32位的有符号整型数表示，所以会有报警产生，即该问题通常出现在默认型存储不够的情况下。
在常数后面增加一个U标识，如果是long或longlong类型加UL或ULL，如4286545791U进行类型强制转换，这样就不会报警了。