[数论] 51nod 1365 Fib(N) mod Fib(K)

$Description$

$Fib(N)$表示斐波那契数列的第$N$项$（F(0) = 0, F(1) = 1）$，给出$N$和$K$，求$Fib(N) \bmod Fib(K)$。由于结果太大，输出$Mod~1000000007$的结果。

$Solution$

先贴几个公式。

$$F_{-n}=(-1)^{n-1}F_n$$ $$F_n=F_kF_{n-k+1}+F_{k-1}F_{n-k}\tag{1}$$ $$F_{k-1}^2+F_{k-1}F_k-F_k^2=(-1)^k\tag{2}$$ $(2)$式可以考虑对 $$\left( \begin{array}{ccc} 1 & 1 \\ 1 & 0 \end{array} \right) ^n= \left( \begin{array}{ccc} F_{n+1} & F_n \\ F_n & F_{n-1} \end{array} \right)$$ 这个等式两边同时计算行列式。 $$F_n\equiv F_{k-1}^{\lfloor{n\over k}\rfloor}F_{n \bmod k}\pmod {F_k}$$ 这就是考虑按 $(1)$式展开就好了。设 $$i = \lfloor{n\over k}\rfloor, j = n\bmod k$$ 所以 $$F_n\equiv F_{k-1}^iF_j\pmod {F_k}$$
这里需要分类讨论 $i$的奇偶性：

若$i$为偶数，考虑将 $(2)$式代入

$$\begin{eqnarray} F_{k-1}^iF_j&=&({F_{k-1}^2+F_{k-1}F_k-F_k^2})^{i\over2}F_j\\ &=&(-1)^{{i\over2}k}F_j \end{eqnarray}$$
若 $i$为奇数，考虑将$(2)$式代入 $$\begin{eqnarray} F_{k-1}^iF_j&=&F_{k-1}^i(F_{k-1}F_{j-k}+F_kF_{j-k+1})\\ &=&F_{k-1}^{i+1}F_{j-k}\\ &=&F_{k-1}^{i+1}(-1)^{k-j-1}F_{k-j}\\ &=&(-1)^{{{i+1}\over 2}k+k-j-1}F_{k-j} \end{eqnarray}$$
到这里就可以通过矩阵乘法快速幂得到答案啦！

#include <bits/stdc++.h>
using namespace std;

const int MOD = 1000000007;
typedef long long ll;

inline void Add(ll &x, ll b) {
    x += b; while (x >= MOD) x -= MOD;
}

inline char get(void) {
    static char buf[100000], *S = buf, *T = buf;
    if (S == T) {
        T = (S = buf) + fread(buf, 1, 100000, stdin);
        if (S == T) return EOF;
    }
    return *S++;
}
template<typename T>
inline void read(T &x) {
    static char c; x = 0;
    for (c = get(); c < '0' || c > '9'; c = get());
    for (; c >= '0' && c <= '9'; c = get()) x = x * 10 + c - '0';
}

ll n, i, j, k, f, ans, fk;
int test;

struct Matrix {
    ll a[3][3];
    inline ll* operator [](ll x) {
        return a[x];
    }
    inline Matrix(void) {
        memset(a, 0, sizeof a);
    }
    inline friend Matrix operator *(Matrix a, Matrix b) {
        Matrix x;
        for (ll i = 1; i <= 2; i++)
            for (ll j = 1; j <= 2; j++)
                for (ll k = 1; k <= 2; k++)
                    Add(x[i][j], a[i][k] * b[k][j] % MOD);
        return x;
    }
};
Matrix Fib, I;

inline Matrix Pow(Matrix a, ll b) {
    Matrix c = I;
    while (b) {
        if (b & 1) c = c * a;
        b >>= 1; a = a * a;
    }
    return c;
}
inline ll F(ll x, ll y, ll z = 0) {
    if ((x & 1) && (y & 1)) return z & 1 ? 1 : -1;
    return z & 1 ? -1 : 1;
}

int main(void) {
    freopen("1.in", "r", stdin);
    I[1][1] = I[2][2] = 1;
    Fib[1][1] = Fib[1][2] = Fib[2][1] = 1;
    read(test);
    while (test--) {
        read(n); read(k);
        i = n / k; j = n % k;
        if (i & 1) {
            if (k - j == k) f = 0;
            else f = Pow(Fib, k - j)[1][2];
            fk = Pow(Fib, k)[1][2];
            ans = F((i + 1) / 2, k, k - j - 1) * f;
            if (ans < 0) ans += fk;
            Add(ans, MOD);
            printf("%d\n", ans);
        } else {
            if (j == k) f = 0;
            else f = Pow(Fib, j)[1][2];
            ans = F(i / 2, k) * f;
            fk = Pow(Fib, k)[1][2];
            if (ans < 0) ans += fk;
            Add(ans, MOD);
            printf("%d\n", ans);
        }
    }
    return 0;
}