HDU - 1588 -- Gauss Fibonacci【矩阵快速幂升级版，如何构造核心矩阵】

Gauss Fibonacci

Description

Without expecting, Angel replied quickly.She says: "I’v heard that you’r a very clever boy. So if you wanna me be your GF, you should solve the problem called GF~. "
How good an opportunity that Gardon can not give up! The “Problem GF” told by Angel is actually “Gauss Fibonacci”.
As we know ,Gauss is the famous mathematician who worked out the sum from 1 to 100 very quickly, and Fibonacci is the crazy man who invented some numbers.

Arithmetic progression:
g(i)=k*i+b;
We assume k and b are both non-nagetive integers.

Fibonacci Numbers:
f(0)=0
f(1)=1
f(n)=f(n-1)+f(n-2) (n>=2)

The Gauss Fibonacci problem is described as follows:
Given k,b,n ,calculate the sum of every f(g(i)) for 0<=i<n
The answer may be very large, so you should divide this answer by M and just output the remainder instead.

Input

The input contains serveral lines. For each line there are four non-nagetive integers: k,b,n,M
Each of them will not exceed 1,000,000,000.

Output

For each line input, out the value described above.

Sample Input

2 1 4 100
2 0 4 100

Sample Output

21
12

思路：

如果你不会构造核心矩阵，那么这篇文章将会帮助你如何构造核心矩阵

AC代码

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
typedef long long ll;
struct Mat{
    ll m[10][10];
}A, B, D, FB, TK, T;
int k, b, n, M;
// 矩阵a与矩阵b相乘
Mat Mult(Mat a, Mat b) {
    Mat res;
    memset(res.m, 0, sizeof(res.m));
    for (int i = 0; i < 10; ++i) {
        for (int j = 0; j < 10; ++j) {
            for (int k = 0; k < 10; ++k) {
                res.m[i][j] = (res.m[i][j] + a.m[i][k] * b.m[k][j]) % M;
            }
        }
    }
    return res;
}
Mat fast_power(Mat a, ll b) {
    Mat res;
    memset(res.m, 0, sizeof(res.m));
    for (int i = 0; i < 10; ++i) res.m[i][i] = 1;
    while(b > 0) {
        if (b & 1) {
            res = Mult(res, a);
        }
        b >>= 1;
        a = Mult(a, a);
    }
    return res;
}
// T，FB，TK，D, B。
void init() {
    T.m[0][0] = 0;  T.m[0][1] = 1;  T.m[1][0] = 1;  T.m[1][1] = 1;
    A.m[0][0] = 0; A.m[0][1] = 1;
    FB = Mult(A, fast_power(T, b));
    TK = fast_power(T, k);
    for (int i = 0; i < 2; ++i) {
        D.m[i][i] = 1;
        B.m[i][i] = B.m[i][i + 2] = 1;
    }
    for (int i = 2; i < 4; ++i) {
        for (int j = 0; j < 2; ++j) {
            D.m[i][j] = D.m[i][j + 2] = TK.m[i - 2][j];
        }
    }
}
void solve() {
    while(scanf("%d%d%d%d", &k, &b, &n, &M) != EOF) {
        init();
        Mat tmp = Mult(B, fast_power(D, n - 1));
        Mat sum;
        memset(sum.m, 0, sizeof(sum.m));
        for (int i = 0; i < 2; ++i) {
            for (int j = 0; j < 2; ++j) {
                sum.m[i][j] = tmp.m[i][j];
            }
        }
        Mat ans = Mult(FB, sum);
        printf("%lld\n", ans.m[0][0]);
    }
}
int main() {
    solve();
    return 0;
}