CodeForces 392C （斐波那契和矩阵的联系）_everyone knows what the fibonacci sequence is. thi-CSDN博客

本文链接：https://blog.csdn.net/thearcticocean/article/details/50300111

http://codeforces.com/problemset/problem/392/C

Description

Everyone knows what the Fibonacci sequence is. This sequence can be defined by the recurrence relation:

F₁ = 1, F₂ = 2, F_i = F_i - 1 + F_i - 2 (i > 2).

We'll define a new number sequence A_i(k) by the formula:

A_i(k) = F_i × i^k (i ≥ 1).

In this problem, your task is to calculate the following sum: A₁(k) + A₂(k) + ... + A_n(k). The answer can be very large, so print it modulo 1000000007(10⁹ + 7).

Input

The first line contains two space-separated integers n, k(1 ≤ n ≤ 10¹⁷; 1 ≤ k ≤ 40).

Output

Print a single integer — the sum of the first n elements of the sequence A_i(k) modulo 1000000007(10⁹ + 7).

Sample Input

Input

1 1

Output

Input

4 1

Output

Input

5 2

Output

Input

7 4

Output

73825

设：
为了方便讨论，先不考虑mod的问题：

读题发现，n很大，k很小，且和斐波那契相关，所以考虑用矩阵把n不断变小。现在找关系：由牛顿二项式定理： $(n+1)^k=C_k^0n^0+C_k^1n^1+C_k^2n^2+\dots+C_k^kn^k=\sum\limits_{i=0}^{k}~C_k^in^i$
有： $\\f[n+1](n+1)^k=f[n](n+1)^k+f[n-1](n+1)^k$
$\\=\sum\limits_{i=0}^{k}C_k^i n^i f[n]+\sum\limits_{i=0}^{k}C_k^i n^i f[n-1]$
为了方便，进一步换元：
$\\u(n+1,k)=\sum\limits_{i=0}^{k}C_k^i u(n,i)+\sum\limits_{i=0}^{k}C_k^{i}v(n,i)$

$f[n](n+1)^k=f[n]\sum\limits_{i=0}^{k} C_k^i n^i=\sum\limits_{i=0}^{k}C_k^if[n]n^i$
$\\v(n+1,k)=\sum\limits_{i=0}^{k}C_k^i u(n,i)$
完成了从n+1变成n，关系矩阵：
$\\\begin{pmatrix}S(n+1,k)\\u(n+1,0)\\u(n+1,1)\\\vdots \\u(n+1,k)\\v(n+1,0)\\v(n+1,1)\\\vdots \\v(n+1,k) \end{pmatrix}=\begin{pmatrix}1 & C_k^0 & C_k^1 &\cdots& C_k^k & C_k^0 & C_k^1 &\cdots& C_k^k\\0 & 1 & 0 &\cdots& 0 & 1 & 0 &\cdots& 0\\0 & C_1^0 & C_1^1 &\cdots& 0 & C_1^0 & C_1^1 &\cdots& 0\\\vdots\\0 & C_k^0 & C_k^1 &\cdots& C_k^k & C_k^0 & C_k^1 &\cdots& C_k^k\\0 & 1 & 0 &\cdots& 0 & 0 & 0 &\cdots& 0\\0 & C_1^0 & C_1^1 &\cdots& 0 & 0 & 0 &\cdots& 0\\\vdots\\0 & C_k^0 & C_k^1 &\cdots& C_k^k & 0 & 0 &\cdots& 0\\\end{pmatrix} \begin{pmatrix}S(n,k)\\u(n,0)\\u(n,1)\\\vdots \\u(n,k)\\v(n,0)\\v(n,1)\\\vdots \\v(n,k) \end{pmatrix}$

当最右边的矩阵n=1时，那一列全是1.
哈哈，接下来就是矩阵快速幂。（第一次用Latex写这么大的矩阵，我的手~~~）

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long LL;
const int mod=1e9+7;
int len;
LL n,k;
LL c[45][45];
struct matrix{
    LL m[100][100];
}mc,I;
matrix multi(matrix a,matrix b){
    matrix ans;
    for(int i=0;i<len;i++){
        for(int j=0;j<len;j++){
            ans.m[i][j]=0;
            for(int k=0;k<len;k++){
                ans.m[i][j]=(ans.m[i][j]+a.m[i][k]*b.m[k][j]%mod)%mod;
            }
        }
    }
    return ans;
}
matrix quick(matrix a, LL n){
    matrix ans=I,t=a;
    while(n>0){
        if(n&1) ans=multi(ans,t);
        t=multi(t,t);
        n>>=1;
    }
    return ans;
}
int main()
{
    c[0][0]=1;
    c[1][0]=c[1][1]=1;
    for(int i=2;i<=40;i++){
        for(int j=0;j<=i;j++){
            if(j==0 || j==i) c[i][j]=1;
            else  c[i][j]=c[i-1][j-1]+c[i-1][j];
        }
    }
    for(int i=0;i<=40;i++){
        I.m[i][i]=1;
    }

    while(cin>>n>>k){
        memset(mc.m,0,sizeof(mc.m));
        len=2*k+3;
        mc.m[0][0]=1;
        for(int j=0;j<=k;j++){
            mc.m[0][j+1]=c[k][j];
            mc.m[0][j+k+2]=c[k][j];
        }
        mc.m[1][1]=mc.m[1][k+2]=1;
        for(int i=1;i<=k;i++){
            for(int j=0;j<=i;j++){
                mc.m[i+1][j+1]=c[i][j];
                mc.m[i+1][j+k+2]=c[i][j];
            }
        }
        mc.m[k+2][1]=1;
        for(int i=1;i<=k;i++){
            for(int j=0;j<=i;j++){
                mc.m[i+k+2][j+1]=c[i][j];
            }
        }

        mc=quick(mc,n-1);
        LL ans=0;
        for(int i=0;i<len;i++){
            ans=(ans+mc.m[0][i]%mod)%mod;
        }
        printf("%I64d\n",ans);
    }
    return 0;
}