矩阵快速幂

struct Matrix {
    double mat[2][2];
};

Matrix mul(Matrix a, Matrix b) {
    Matrix ret;
    for(int i = 0; i < 2; ++i) {
        for(int j = 0; j < 2; ++j) {
            ret.mat[i][j] = 0;
            for(int k = 0; k < 2; ++k) {
                ret.mat[i][j] += a.mat[i][k] * b.mat[k][j];
            }
        }
    }
    return ret;
}

Matrix powMatrix(Matrix a, int n) {
    Matrix ret;
    memset(ret.mat,0,sizeof(ret.mat));
    for(int i = 0; i < 2; ++i) {
        ret.mat[i][i] = 1;
    }
    Matrix tmp = a;
    while(n) {
        if(n & 1) {
            ret = mul(ret,tmp);
        }
        tmp = mul(tmp,tmp);
        n >>= 1;
    }
    return ret;
}