刷题记录（NC25354 愉快的递推式、NC15666 又见斐波那契）

rootting

已于 2022-12-08 20:30:12 修改

阅读量195

点赞数

分类专栏：刷题记录文章标签：算法

于 2022-12-07 00:02:15 首次发布

本文链接：https://blog.csdn.net/m0_60531106/article/details/128212761

版权

刷题记录专栏收录该内容

103 篇文章 0 订阅

订阅专栏

NC25354 愉快的递推式

题目链接

关键点：

1、首先求出递推式数组：

关于f(n) = 3*f(n-1) + 2*f(n-2) + 2

int a[3][3] = {
{3, 2, 2},
{1, 0, 0},
{0, 0, 1}
}; 与g{ f(n-1), f(n-2), 1 }相乘，得到下一个递推式{f(n), f(n-1), 1}

2、确定初始值f[1] = f[2] = 1, 即刚开始{ f(n-1), f(n-2), 1 }数组为{1， 1， 1}

3、一个矩阵乘法计算a*g, 一个计算a*a

a*g

void mulg()
{
    int f[3] = {0};
    for (int i=0; i<3; i++)
    {
        for (int j=0; j<3; j++)
        {
            f[i] = (ll)(f[i] + (ll)g[j] * a[i][j])%MOD;
        }
    }
    memcpy(g, f, sizeof (g));
}

a*a

void mula()
{
    int c[3][3] = {0};
    for (int i=0; i<3; i++)
    {
        for (int j=0; j<3; j++)
        {
            for (int k=0; k<3; k++)
                c[i][j] = (ll)(c[i][j] + (ll)a[i][k]*a[k][j])%MOD;
        }
    }
    memcpy(a, c, sizeof (a));
}

矩阵快速幂

        while (m)
        {
            if (m&1) mulg();
            mula();
            m>>=1;
        }
        int

最后别忘了还要在乘一次递推式

int ans = (ll)((ll)g[0]*3%MOD + (ll)g[1]*2%MOD + (ll)g[2]*2%MOD)%MOD;

4、几乎所有计算的数字设为int，但是相乘途中肯定会出现大于int的范围的情况，那么就在乘的过程中，转化为long long类型

完整代码：

# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
ll n;
int a[3][3] = {
    {3, 2, 2},
    {1, 0, 0},
    {0, 0, 1}
};
int g[3] = {1, 1, 1};
void mulg()
{
    int f[3] = {0};
    for (int i=0; i<3; i++)
    {
        for (int j=0; j<3; j++)
        {
            f[i] = (ll)(f[i] + (ll)g[j] * a[i][j])%MOD;
        }
    }
    memcpy(g, f, sizeof (g));
}
void mula()
{
    int c[3][3] = {0};
    for (int i=0; i<3; i++)
    {
        for (int j=0; j<3; j++)
        {
            for (int k=0; k<3; k++)
                c[i][j] = (ll)(c[i][j] + (ll)a[i][k]*a[k][j])%MOD;
        }
    }
    memcpy(a, c, sizeof (a));
}
int main()
{
    scanf("%lld", &n);
    if (n<=2)
        printf("1\n");
    else
    {
        ll m = n-3;
        while (m)
        {
            if (m&1) mulg();
            mula();
            m>>=1;
        }
        int ans = (ll)((ll)g[0]*3%MOD + (ll)g[1]*2%MOD + (ll)g[2]*2%MOD)%MOD;
        printf("%d\n", ans);
    }
    
    
    
    return 0;
}

NC15666 又见斐波那契

题目链接

关键点：

1、同样的推出矩阵公式

int g[6][6] = {
{1, 1, 1, 1, 1, 1},
{1, 0, 0, 0, 0, 0},
{0, 0, 1, 3, 3, 1},
{0, 0, 0, 1, 2, 1},
{0, 0, 0, 0, 1, 1},
{0, 0, 0, 0, 0, 1}
};

与a[6] = {f[i-1], f[i-2], i^3, i^2, i, 1};相乘为

res[6] = {f[i], f[i-1], (i+1)^3, (i+1)^2, 1}

随后就是与上面同样的求法，因为本题有多次输入，因此，每次都要初始化两个数组

# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
ll n, t;
int g[6][6] = {
    {1, 1, 1, 1, 1, 1},
    {1, 0, 0, 0, 0, 0},
    {0, 0, 1, 3, 3, 1},
    {0, 0, 0, 1, 2, 1},
    {0, 0, 0, 0, 1, 1},
    {0, 0, 0, 0, 0, 1}
};
int a[6] = {1, 0, 8, 4, 2, 1};
void mula()
{
    int f[6] = {0};
    for (int i=0; i<6; i++)
    {
        for (int j=0; j<6; j++)
            f[i] = (ll)(f[i] + ((ll)a[j]*g[i][j])%MOD)%MOD;
    }
    memcpy(a, f, sizeof(a));
}
void mulg()
{
    int f[6][6] = {0};
    for (int i=0; i<6; i++)
    {
        for (int j=0; j<6; j++)
        {
            for (int k=0; k<6; k++)
            {
                f[i][j] = (ll)(f[i][j] + ((ll)g[i][k]*g[k][j])%MOD)%MOD;
            }
        }
    }
    memcpy(g, f, sizeof(g));
}
void init()
{
    g[0][0] = 1; g[0][1] = 1; g[0][2] = 1; g[0][3] = 1; g[0][4] = 1; g[0][5] = 1; 
    g[1][0] = 1; g[1][1] = 0; g[1][2] = 0; g[1][3] = 0; g[1][4] = 0; g[1][5] = 0; 
    g[2][0] = 0; g[2][1] = 0; g[2][2] = 1; g[2][3] = 3; g[2][4] = 3; g[2][5] = 1; 
    g[3][0] = 0; g[3][1] = 0; g[3][2] = 0; g[3][3] = 1; g[3][4] = 2; g[3][5] = 1; 
    g[4][0] = 0; g[4][1] = 0; g[4][2] = 0; g[4][3] = 0; g[4][4] = 1; g[4][5] = 1; 
    g[5][0] = 0; g[5][1] = 0; g[5][2] = 0; g[5][3] = 0; g[5][4] = 0; g[5][5] = 1; 
        
    a[0] = 1; a[1] = 0; a[2] = 8; a[3] = 4; a[4] = 2; a[5] = 1;
}
ll find(ll n)
{
    if (n==0)
        return 0;
    if (n == 1)
        return 1;
    init();
    n-=2;
    while (n)
    {
        if (n&1) mula();
        mulg();
        n>>=1;
//         for (int i=0; i<6; i++)
//             cout<<a[i]<<" ";
    }
//     cout<<endl;
    int ans = (ll)((ll)a[0]%MOD + (ll)a[1]%MOD + (ll)a[2]%MOD + (ll)a[3]%MOD + (ll)a[4]%MOD + (ll)a[5]%MOD)%MOD;
    return ans;
}
int main()
{
    scanf("%lld", &t);
    while (t--)
    {
        scanf("%lld", &n);
        printf("%lld\n", find(n));
    }
    
    
    return 0;
}