LightOJ - 1006 Hex-a-bonacci_a - hex-a-bonacci-CSDN博客

本文链接：https://blog.csdn.net/wang2332/article/details/81514439

本文探讨了三种解决六阶线性递归数列问题的方法：递推法，通过迭代更新数列；记忆化搜索，利用缓存避免重复计算；矩阵快速幂，高效计算大项数列值。每种方法都有其适用场景和优缺点。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

数据量很小随便写都行

递推：

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

#define se second
#define fi first
#define ll long long
#define pb push_back
#define CLR(a,b) memset(a,(b),sizeof(a))
const int MAXN = (int)1e4+10;
const int mod = 10000007;

int f[MAXN];

int main() {
    int T; cin >> T;
    int kk = 0;
    while(T--) {
        CLR(f, 0);
        int n;
        for(int i = 0; i < 6; ++i)
            cin >> f[i];
        cin >> n;
        for(int i = 6; i <= n; ++i)
            f[i] = (f[i-1]%mod+f[i-2]%mod+f[i-3]%mod+f[i-4]%mod+f[i-5]%mod+f[i-6]%mod)%mod;
        printf("Case %d: %d\n", ++kk, f[n] % mod);
    }
    return 0;
}

记忆化搜索:

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

#define se second
#define fi first
#define ll long long
#define pb push_back
#define CLR(a,b) memset(a,(b),sizeof(a))
const int MAXN = (int)1e4+10;
const int mod = 10000007;

int f[MAXN];

int dfs(int x) {
    if(f[x] != -1)
        return f[x]%mod;
    else
        return f[x] = (dfs(x-1)%mod+dfs(x-2)%mod+dfs(x-3)%mod+dfs(x-4)%mod+dfs(x-5)%mod+dfs(x-6)%mod)%mod;
}
int main() {
    int T; cin >> T;
    int kk = 0;
    while(T--) {
        CLR(f, -1);
        int n;
        for(int i = 0; i < 6; ++i)
            cin >> f[i];
        cin >> n;
        printf("Case %d: %d\n", ++kk, dfs(n) % mod);
    }
    return 0;
}

矩阵快速幂:

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

#define se second
#define fi first
#define ll long long
#define pb push_back
#define CLR(a,b) memset(a,(b),sizeof(a))
const int MAXN = (int)1e4+10;
const int mod = 10000007;

struct node {
    ll mm[6][6];
};
node mul(node x, node y) {
    node ans;
    CLR(ans.mm, 0);
    for(int i = 0; i < 6; ++i) {
        for(int j = 0; j < 6; ++j) {
            for(int k = 0; k < 6; ++k) {
                ans.mm[i][j] = (ans.mm[i][j]+x.mm[i][k]*y.mm[k][j])%mod;
            }
        }
    }
    return ans;
}
node pow_mod(node res, ll x) {
    node ans;
    CLR(ans.mm, 0);
    for(int i = 0; i < 6; ++i) {
        ans.mm[i][i] = 1;
    }
    while(x) {
        if(x&1)
            ans = mul(ans, res);
        res = mul(res, res);
        x >>= 1;
    }
    return ans;
}

int main() {
    int T; cin >> T;
    ll kk = 0;
    while(T--) {
        node x;
        CLR(x.mm, 0);
        for(int i = 0; i < 6; ++i) x.mm[0][i] = 1;
        x.mm[1][0] = 1; x.mm[2][1] = 1; x.mm[3][2] = 1;
        x.mm[4][3] = 1; x.mm[5][4] = 1;
        ll a, b, c, d, e, f;
        cin >> a >> b >> c >> d >> e >> f;
        cout << "Case " << ++kk << ": ";
        ll n; cin >> n;
        if(n < 6) {
            if(n == 0) cout << a%mod << endl;
            if(n == 1) cout << b%mod << endl;
            if(n == 2) cout << c%mod << endl;
            if(n == 3) cout << d%mod << endl;
            if(n == 4) cout << e%mod << endl;
            if(n == 5) cout << f%mod << endl;
        }
        else {
            node xx = pow_mod(x, n-5);
            cout << (xx.mm[0][0]*f+xx.mm[0][1]*e+xx.mm[0][2]*d+xx.mm[0][3]*c+xx.mm[0][4]*b+xx.mm[0][5]*a)%mod << endl;
        }

    }
    return 0;
}