BZOJ5118 Fib数列2（矩阵快速幂）

　　特殊矩阵的幂同样满足费马小定理。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
#define int long long
char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')&&(c<''||c>'')) c=getchar();return c;}
int gcd(int n,int m){return m==?n:gcd(m,n%m);}
int read()
{
    int x=,f=;char c=getchar();
    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}
    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();
    return x*f;
}
const int P=1125899839733759ll;
int T,n;
int ksc(int a,int b,int p)
{
    int t=a*b-(int)((long double)a*b/p+0.5)*p;
    return t<?t+p:t;
}
int ksm(int a,int k,int p)
{
    int s=;
    for (;k;k>>=,a=ksc(a,a,p)) if (k&) s=ksc(s,a,p);
    return s;
}
struct matrix
{
    int n,a[][];
    matrix operator *(const matrix&b) const
    {
        matrix c;c.n=n;memset(c.a,,sizeof(c.a));
        for (int i=;i<n;i++)
            for (int j=;j<;j++)
                for (int k=;k<;k++)
                c.a[i][j]=(c.a[i][j]+ksc(a[i][k],b.a[k][j],P))%P;
        return c;
    }
}f,a;
signed main()
{
#ifndef ONLINE_JUDGE
    freopen("bzoj5118.in","r",stdin);
    freopen("bzoj5118.out","w",stdout);
    const char LL[]="%I64d\n";
#else
    const char LL[]="%lld\n";
#endif
    T=read();
    while (T--)
    {
        n=ksm(,read(),P-);
        f.n=;f.a[][]=,f.a[][]=;
        a.n=;a.a[][]=,a.a[][]=a.a[][]=a.a[][]=;
        for (;n;n>>=,a=a*a) if (n&) f=f*a;
        cout<<f.a[][]<<endl;
    }
    return ;
}