数列求值-------------------------------------------思维(矩阵快速幂)

解析:
F_n = $\left[\begin{array}{cc}fn& fn+1\end{array}\right]$
F_n+1 = $\left[\begin{array}{cc}fn+1& fn+2\end{array}\right]$

$\left[\begin{array}{cc}fn& fn+1\end{array}\right]$ * $\left[\begin{array}{cc}0& c\\ 1& b\end{array}\right]$ = $\left[\begin{array}{cc}fn+1& fn+2\end{array}\right]$

$\left[\begin{array}{cc}0& 1\end{array}\right]$ * $\left[\begin{array}{cc}0& c\\ 1& b\end{array}\right]$ ⁿ = $\left[\begin{array}{cc}fn+1& fn+2\end{array}\right]$

class Solution {
public:
    long long  MOD=1000000007;
 struct lxw
{
    long long  res[2][2];
}node,base;
lxw multi(lxw a,lxw b)
{

    lxw tmp;
    memset(tmp.res,0,sizeof tmp.res);
    for(int i=0;i<2;i++)
        for(int j=0;j<2;j++)
            for(int k=0;k<2;k++)
                tmp.res[i][j]=(tmp.res[i][j]+a.res[i][k]*b.res[k][j])%MOD;
    return tmp;
}
    long long nthElement(long long n, long long b, long long c) {
        memset(node.res,0,sizeof node.res);
         memset(base.res,0,sizeof base.res);
          node.res[0][0]=0;node.res[0][1]=1;
        base.res[0][1]=c;base.res[1][0]=1;base.res[1][1]=b;
        
        while(n){
            if(n&1) node=multi(node,base);
            base=multi(base,base);
            n>>=1;
        }
     
        return node.res[0][0]%MOD;
    }
};