LightOj 1006 Hex-a-bonacci（矩阵快速幂）-CSDN博客

本文介绍了一种利用矩阵快速幂的方法来高效求解Hex-a-bonacci数列问题，该方法避免了传统递归带来的整数溢出问题，并通过样例输入输出展示了算法的有效性。

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

Hex-a-bonacci

Description

Given a code (not optimized), and necessary inputs, you have to find the output of the code for the inputs. The code is as follows:

int a, b, c, d, e, f;
int fn( int n ) {
    if( n == 0 ) return a;
    if( n == 1 ) return b;
    if( n == 2 ) return c;
    if( n == 3 ) return d;
    if( n == 4 ) return e;
    if( n == 5 ) return f;
    return( fn(n-1) + fn(n-2) + fn(n-3) + fn(n-4) + fn(n-5) + fn(n-6) );
}
int main() {
    int n, caseno = 0, cases;
    scanf("%d", &cases);
    while( cases-- ) {
        scanf("%d %d %d %d %d %d %d", &a, &b, &c, &d, &e, &f, &n);
        printf("Case %d: %d\n", ++caseno, fn(n) % 10000007);
    }
    return 0;
}

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case contains seven integers, a, b, c, d, e, f and n. All integers will be non-negative and 0 ≤ n ≤ 10000 and the each of the others will be fit into a 32-bit integer.

Output

For each case, print the output of the given code. The given code may have integer overflow problem in the compiler, so be careful.

Sample Input

0 1 2 3 4 5 20

3 2 1 5 0 1 9

4 12 9 4 5 6 15

9 8 7 6 5 4 3

3 4 3 2 54 5 4

Sample Output

Case 1: 216339

Case 2: 79

Case 3: 16636

Case 4: 6

Case 5: 54

算法思想：

构造一个6*6的矩阵

⎛⎝⎜⎜⎜⎜⎜⎜⎜⎜111111100000010000001000000100000010⎞⎠⎟⎟⎟⎟⎟⎟⎟⎟

然后用矩阵快速幂即可。

AC代码：

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

typedef long long ll;
const int MOD = 10000007;

struct Matrix{
    ll ary[6][6];
    void init(){
        memset(ary,0,sizeof(ary));
    }
    Matrix(){
        init();
    }
};

Matrix multi(Matrix a, Matrix b){
    Matrix tmp;
    for(int i = 0; i < 6; ++i){
        for(int j = 0; j < 6; ++j){
            for(int k = 0; k < 6; ++k)
                tmp.ary[i][j] = (tmp.ary[i][j] + a.ary[i][k] * b.ary[k][j]) % MOD;
        }
    }
    return tmp;
}

Matrix quick_pow(Matrix base, int cnt) {
    Matrix ans;
    for(int i = 0; i < 6; ++i)
        ans.ary[i][i] = 1;
    while(cnt){
        if(cnt & 1)
            ans = multi(ans,base);
        cnt >>= 1;
        base = multi(base,base);
    }
    return ans;
}

ll f[10];

int main(){
    int T, t = 1;
    Matrix base;
    for (int i = 0; i < 6; ++i)
        base.ary[i][0] = 1;
    for (int i = 1; i < 6; ++i)
        base.ary[i - 1][i] = 1;
    scanf("%d",&T);
    while(T--){
        int n;
        for(int i = 0; i < 6; ++i){
            scanf("%lld", &f[i]);
            f[i] %= MOD;
        }
        scanf("%d",&n);
        if(n <= 5){
            printf("Case %d: %lld\n",t++,f[n]);
            continue;
        }
        Matrix ret;
        for (int i = 0; i < 6; ++i)
            ret.ary[0][i] = f[5 - i];
        Matrix ans = quick_pow(base,n - 5);
        ans = multi(ret,ans);
        printf("Case %d: %lld\n",t++,ans.ary[0][0]);
    }
    return 0;
}