斐波那契级数比内矩阵的C++实现

#include <iostream>
#include <vector>

using namespace std;

// 定义矩阵乘法函数
vector<vector<long long>> matrixMultiply(const vector<vector<long long>>& matrix1, const vector<vector<long long>>& matrix2) {
    int rows1 = matrix1.size();
    int cols1 = matrix1[0].size();
    int cols2 = matrix2[0].size();

    vector<vector<long long>> result(rows1, vector<long long>(cols2, 0));

    for (int i = 0; i < rows1; i++) {
        for (int j = 0; j < cols2; j++) {
            for (int k = 0; k < cols1; k++) {
                result[i][j] += matrix1[i][k] * matrix2[k][j];
            }
        }
    }

    return result;
}

// 定义斐波那契级数比内矩阵的C++实现函数
long long fibonacciMatrix(int n) {
    if (n <= 0) {
        return 0;
    }

    vector<vector<long long>> baseMatrix = { {1, 1}, {1, 0} };
    vector<vector<long long>> resultMatrix = { {1, 0}, {0, 1} };

    while (n > 0) {
        if (n % 2 == 1) {
            resultMatrix = matrixMultiply(resultMatrix, baseMatrix);
        }
        baseMatrix = matrixMultiply(baseMatrix, baseMatrix);
        n /= 2;
    }

    return resultMatrix[0][1];
}

int main() {
    int n = 10;
    long long fibonacciNumber = fibonacciMatrix(n);
    cout << "The " << n << "th Fibonacci number is: " << fibonacciNumber << endl;

    return 0;
}