HDU - 5451 Best Solver（循环节+矩阵快速幂）

Best Solver

The so-called best problem solver can easily solve this problem, with his/her childhood sweetheart.

It is known that y=(5+26–√)1+2xy=(5+26)1+2x. 
For a given integer x (0≤x<232)x (0≤x<232) and a given prime number M (M≤46337)M (M≤46337), print [y]%M[y]%M. ([y][y] means the integer part of yy) 

InputAn integer T (1<T≤1000)T (1<T≤1000), indicating there are TT test cases. 
Following are TT lines, each containing two integers xx and MM, as introduced above.OutputThe output contains exactly TT lines. 
Each line contains an integer representing [y]%M[y]%M.Sample Input

7
0 46337
1 46337
3 46337
1 46337
21 46337
321 46337
4321 46337

Sample Output

Case #1: 97
Case #2: 969
Case #3: 16537
Case #4: 969
Case #5: 40453
Case #6: 10211
Case #7: 17947

循环节题目常见的有两种情况：
1.MOD-1
2.MOD^2-1
通过推导或暴力可求出。

本题循环节MOD^2-1。

#include<bits/stdc++.h>
#define MAX 3
using namespace std;
typedef long long ll;

ll n,MOD;
struct mat{
    ll a[MAX][MAX];
};

mat operator *(mat x,mat y)
{
    mat ans;
    memset(ans.a,,sizeof(ans.a));
    for(int i=;i<=;i++){
        for(int j=;j<=;j++){
            for(int k=;k<=;k++){
                ans.a[i][j]+=(x.a[i][k]*y.a[k][j]+MOD)%MOD;
                ans.a[i][j]%=MOD;
            }
        }
    }
    return ans;
}
mat qMod(mat a,ll n)
{
    mat t;
    t.a[][]=;t.a[][]=-;
    t.a[][]=;t.a[][]=;
    while(n){
        if(n&) a=t*a;
        n>>=;
        t=t*t;
    }
    return a;
}
ll qsortMod(ll a,ll b)
{
    ll ans=;
    a%=((MOD+)*(MOD-));
    while(b){
        if(b&) ans=ans*a%((MOD+)*(MOD-));
        b>>=;
        a=a*a%((MOD+)*(MOD-));
    }
    return ans;
}
int main()
{
    int tt=,t,i;
    scanf("%d",&t);
    while(t--){
        scanf("%I64d%I64d",&n,&MOD);
        mat a;
        a.a[][]=;a.a[][]=;
        a.a[][]=;a.a[][]=;
        a=qMod(a,qsortMod(,n));
        printf("Case #%d: %I64d\n",++tt,(a.a[][]-+MOD)%MOD);

    }
    return ;
}