HDU6395 Sequence(2018HDU多校联赛第七场,整数分块，矩阵快速幂)

Problem Description

Let us define a sequence as below

$\left\{\begin{eqnarray*} F_1 &=& A \\ F_2 &=& B \\ F_n &=& C\cdot{}F_{n-2}+D\cdot{}F_{n-1}+\left\lfloor\frac{P}{n}\right\rfloor \end{eqnarray*}\right.$

 Your job is simple, for each task, you should output $F_n$ module $10^9+7$.

Input

The first line has only one integer T, indicates the number of tasks.
Then, for the next T lines, each line consists of 6 integers, A , B, C, D, P, n.
1≤T≤200≤A,B,C,D≤1091≤P,n≤109

Sample Input

2
3 3 2 1 3 5
3 2 2 2 1 4

Sample Output

36
24

思路

题意是给出一个递推式，求第$n$项的值,已知$A , B, C, D, P, n$

因为$\left\lfloor\frac{P}{n}\right\rfloor$的值一直在变化，所以我们不能直接利用矩阵快速幂，我们因为在一定的区间内$\left\lfloor\frac{P}{n}\right\rfloor$的值是不变的，所以我们可以把这个分成若干个小段来求。

我们可以用$p/(p/i)$求出当前的段。

对于每一段，值不变，所以进行多次矩阵快速幂即可

我们可以写出初始矩阵$A$和转置矩阵$B$.

$$A= \left\{ \begin{matrix} b & a & \left\lfloor\frac{P}{n}\right\rfloor \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{matrix} \right\}$$

$$B= \left\{ \begin{matrix} d & 1 & 0 \\ c & 0 & 0 \\ 1 & 0 & 1 \end{matrix} \right\}$$

两个相乘就可以从$[f_2,f_1,\left\lfloor\frac{P}{n}\right\rfloor]$,推出来$[f_3,f_2,\left\lfloor\frac{P}{n}\right\rfloor ]$

然后判断$p$和$n$的大小关系，分段即可

代码

#include <bits/stdc++.h>
using namespace std;
#define mem(a, b) memset(a, b, sizeof(a))
typedef long long ll;
const ll mod = 1e9 + 7;
const ll N = 3;
struct Matrix
{
    ll a[N][N];
    Matrix()
    {
        mem(a, 0);
    }
    void init()
    {
        mem(a, 0);
        for (ll i = 0; i < N; i++)
            a[i][i] = 1;
    }
};
void print(Matrix a)
{
    for (ll i = 0; i < N; i++)
    {
        for (ll j = 0; j < N; j++)
            printf("%lld ", a.a[i][j]);
        puts("");
    }
}
Matrix mul(Matrix a, Matrix b)
{
    Matrix ans;
    for (ll i = 0; i < N; i++)
        for (ll j = 0; j < N; j++)
            for (ll k = 0; k < N; k++)
            {
                ans.a[i][j] += a.a[i][k] * b.a[k][j];
                ans.a[i][j] %= mod;
            }
    return ans;
}
Matrix mat_pow(Matrix a, ll n)
{
    Matrix ans;
    ans.init();
    while (n)
    {
        if (n & 1)
            ans = mul(ans, a);
        a = mul(a, a);
        n >>= 1;
    }
    return ans;
}
void solve()
{
    ll a, b, c, d, p, n;
    scanf("%lld%lld%lld%lld%lld%lld", &a, &b, &c, &d, &p, &n);
    if (n == 1)
    {
        printf("%lld\n", a);
        return;
    }
    Matrix A, B; //分别被为初始矩阵和转置矩阵
    A.a[0][0] = b;
    A.a[0][1] = a;
    B.a[0][0] = d;
    B.a[0][1] = 1;
    B.a[1][0] = c;
    B.a[2][0] = 1;
    B.a[2][2] = 1;
    if (p >= n)
    {
        for (ll i = 3, j; i <= n; i = j + 1)
        {
            j = p / (p / i);
            A.a[0][2] = p / i;
            Matrix po = mat_pow(B, min(j - i + 1, n - i + 1));
            A = mul(A, po);
        }
    }
    else
    {
        for (ll i = 3, j; i <= p; i = j + 1)
        {
            j = p / (p / i);
            A.a[0][2] = p / i;
            Matrix po = mat_pow(B, j - i + 1);
            A = mul(A, po);
        }
        Matrix po;
        A.a[0][2] = 0;
        if (p < 3)
            po = mat_pow(B, n - 2);
        else
            po = mat_pow(B, n - p);
        A = mul(A, po);
    }
    printf("%lld\n", A.a[0][0]);
}
int main()
{
    //freopen("in.txt", "r", stdin);
    ll t;
    scanf("%lld", &t);
    while (t--)
        solve();
    return 0;
}