HDU 1757 A Simple Math Problem [矩阵快速幂]

题目链接： HDU 1757 A Simple Math Problem

Problem Description

Lele now is thinking about a simple function f(x).

If x < 10 f(x) = x.
If x >= 10 f(x) = a0 * f(x-1) + a1 * f(x-2) + a2 * f(x-3) + …… + a9 * f(x-10);
And ai(0<=i<=9) can only be 0 or 1 .

Now, I will give a0 ~ a9 and two positive integers k and m ,and could you help Lele to caculate f(k)%m.

Input

The problem contains mutiple test cases.Please process to the end of file.
In each case, there will be two lines.
In the first line , there are two positive integers k and m. ( k<2*10^9 , m < 10^5 )
In the second line , there are ten integers represent a0 ~ a9.

Output

For each case, output f(k) % m in one line.

Sample Input

10 9999
1 1 1 1 1 1 1 1 1 1
20 500
1 0 1 0 1 0 1 0 1 0

Sample Output

45
104

题解：

矩阵的快速幂
容易发现

$$f(x) = \begin{bmatrix} f(x-1) & f(x-2) & \dots & f(x-10) \end{bmatrix} \begin{bmatrix} a_0\\ a_1\\ \vdots\\ a_9 \end{bmatrix}$$
要用快速幂，就要凑成方阵的形式，观察发现 $M_i *A = M_{i+1}$ 的形式：
$$\begin{bmatrix} f(x-1) & f(x-2) & \dots & f(x-10)\\ f(x-2) & f(x-3) & \dots & f(x-11)\\ \vdots & \vdots & \ddots & \vdots\\ f(x-10) & \dots & \dots & f(x-19) \end{bmatrix} \begin{bmatrix} a_0 & 1 & 0 & 0 & \dots & 0\\ a_1 & 0 & 1 & 0 & \dots & \vdots\\ a_3 & 0 & 0 & 1 & \dots & \vdots\\ \vdots & \vdots & \vdots & \vdots & \ddots & 1\\ a_9 & 0 & 0 & 0 & \dots & 0 \end{bmatrix} = \begin{bmatrix} f(x) & f(x-1) & \dots & f(x-9)\\ f(x-1) & f(x-2) & \dots & f(x-10)\\ \vdots & \vdots & \ddots & \vdots\\ f(x-9) & \dots & \dots & f(x-18) \end{bmatrix}$$
初始矩阵M为
$$\begin{bmatrix} f(19) & f(18) & \dots & f(10)\\ f(18) & f(17) & \dots & f(9)\\ \vdots & \vdots & \ddots & \vdots\\ f(10) & \dots & \dots & f(1) \end{bmatrix}$$
$x$ 小于20，可以用公式直接求，反正数据小，没有优化的必要。$x$ 大于20, 只需要用初始矩阵乘以A矩阵
$$\begin{bmatrix} a_0 & 1 & 0 & 0 & \dots & 0\\ a_1 & 0 & 1 & 0 & \dots & \vdots\\ a_3 & 0 & 0 & 1 & \dots & \vdots\\ \vdots & \vdots & \vdots & \vdots & \ddots & 1\\ a_9 & 0 & 0 & 0 & \dots & 0 \end{bmatrix}$$
的 $x-19$ 次方
这里就可以用到快速幂来求解。

代码：

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

typedef int Mat[11][11];
int k, m;
Mat A, T, M;
int a[20];

void matmul(Mat a, Mat b) {
    Mat c;
    memset(c, 0, sizeof(c));
    for (int i = 0; i < 10; i++) {
        for (int j = 0; j < 10; j++) {
            for (int k = 0; k < 10; k++) {
                c[i][j] += a[i][k]*b[k][j];
            }
            c[i][j] %= m;
        }
    }
    for (int i = 0; i < 10; i++) 
        for (int j = 0; j < 10; j++)
            a[i][j] = c[i][j];

}
int fun(int x) {
    if (x < 10) return x%m;
    else {
        int sum = 0;
        for (int i = 0; i < 10; i++) {
            if (a[i]==1) {
                sum += fun(x-(i+1));
            }
        }
        return sum%m;
    }
}

int main() {

    while (cin >> k >> m) {
        memset(A, 0, sizeof(A));
        memset(M, 0, sizeof(M));
        memset(T, 0, sizeof(T));


        for (int i = 0; i < 9; i++) {
            T[i][i+1] = 1;
        }
        for (int i = 0; i < 10; i++) {
            cin >> a[i];
            T[i][0] = a[i];
            A[i][i] = 1;
        }

        if (k < 20) {
            cout << fun(k)%m << endl;
        }
        else {

            k -= 19;
            for (int i = 0; i < 10; i++) {
                for (int j = 0; j < 10; j++) {
                    M[i][j] = fun(20-i-j-1);
                }
            }
            while (k > 0) {
                if (k&1) matmul(A, T);
                k >>= 1;
                matmul(T,T);
            }
            matmul(M, A);
            cout << M[0][0] << endl;

        }   
    }

    return 0;
}