POJ 3070 矩阵快速幂

题意

传送门 POJ 3070

题解

裸的矩阵快速幂，若题中没有给出矩阵形式，可以根据递推式写出。

一般的，对于 m 项递推式，如果记递推式为

$a_{n+m}=\sum _{i=0}^{m-1}{b}_i{a}_{n+i}$

则可以把递推式写成如下矩阵形式

$\left(\begin{array}{c}{a}_{n+m}\\ a_{n+m-1}\\ ⋮\\ a_{n+1}\end{array}\right)=\left(\begin{array}{cccc}{b}_{m-1}& \cdots & b_1& b_0\\ 1& \cdots & 0& 0\\ ⋮& \ddots & ⋮& ⋮\\ 0& \cdots & 1& 0\end{array}\right)\left(\begin{array}{c}{a}_{n+m-1}\\ a_{n+m-2}\\ ⋮\\ a_n\end{array}\right)$

#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define inf 0x3f3f3f3f
#define mod 10000
typedef vector<int> vec;
typedef vector<vec> mat;

mat mul(mat &A, mat &B)
{
    mat C(A.size(), vec(B[0].size()));
    for (int i = 0; i < A.size(); i++)
    {
        for (int k = 0; k < B.size(); k++)
        {
            for (int j = 0; j < B[0].size(); j++)
            {
                C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % mod;
            }
        }
    }
    return C;
}

mat pow(mat A, int n)
{
    mat B(A.size(), vec(A.size()));
    for (int i = 0; i < A.size(); i++) B[i][i] = 1;
    while (n)
    {
        if (n & 1) B = mul(B, A);
        A = mul(A, A);
        n >>= 1;
    }
    return B;
}

int main()
{
    int n;
    while (~scanf("%d", &n) && n != -1)
    {
        mat A(2, vec(2));
        A[0][0] = 1, A[0][1] = 1;
        A[1][0] = 1, A[1][1] = 0;
        A = pow(A, n);
        printf("%d\n", A[0][1]);
    }
    return 0;
}