hdu 4565 推倒公式+矩阵快速幂

题意

求下式的值：

$S_n = \lceil\ (a + \sqrt{b}) ^ n \rceil\% m$

其中：

$0< a, m < 2^{15}$
$0 < b, n < 2^{31}$
$(a-1)^2< b < a^2$

解析

令：

$A_n = (a + \sqrt{b}) ^ n$

$B_n = (a - \sqrt{b}) ^ n$

$C_n = A_n + B_n$

因为：$(a - 1)^2 < b < a^2$

所以：$0 < a - \sqrt{b} < 1$

所以：$0 < (a - \sqrt{b})^n < 1$

即： $B_n < 1$

也就是说，$C_n = \lceil\ A_n \rceil\ $，$S_n = C_n % m$

因此，求$C_n$就行了。

$C_n$两边同时乘以$A_1 + B_1$：

$C_n*[(a + \sqrt{b}) + ( a - \sqrt{b})]$

$= [(a + \sqrt{b})^n + (a - \sqrt{b})^n] * [(a + \sqrt{b}) + ( a - \sqrt{b})]$

$= (a + \sqrt{b})^{n+1} + (a - \sqrt{b})^{n+1} + (a + \sqrt{b})^n * (a - \sqrt{b}) + (a - \sqrt{b})^n*(a + \sqrt{b})$

$=C_{n+1} + (a^2-b)*(a+\sqrt{b})^{n-1} + (a^2-b)*(a-\sqrt{b})^{n-1}$

$=C_{n+1} + (a^2-b)*C_{n-1}$

所以：

$C_{n + 1} = 2*a*C_n - (a^2-b)*C_{n - 1}$

写成矩阵形式：

$\begin{bmatrix}C_{n+1} \ C_n \ \end{bmatrix} = \begin{bmatrix}2*a & -(a^2-b)\\1 & 0 \\ \end{bmatrix} * \begin{bmatrix}C_1 \\C_0 \\ \end{bmatrix}$

至此，公式推导完毕，用快速幂求解就行了。

代码

#pragma comment(linker, "/STACK:1677721600")
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cassert>
#include <iostream>
#include <algorithm>
#define pb push_back
#define mp make_pair
#define LL long long
#define lson lo,mi,rt<<1
#define rson mi+1,hi,rt<<1|1
#define Min(a,b) ((a)<(b)?(a):(b))
#define Max(a,b) ((a)>(b)?(a):(b))
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define mem(a,b) memset(a,b,sizeof(a))
#define FIN freopen("in.txt", "r", stdin)
#define FOUT freopen("out.txt", "w", stdout)

using namespace std;
const double eps = 1e-8;
const double ee = exp(1.0);
const int inf = 0x3f3f3f3f;
const int maxn = 1e3 + 10;
const double pi = acos(-1.0);
const LL iinf = 0x3f3f3f3f3f3f3f3f;

int readT()
{
    char c;
    int ret = 0,flg = 0;
    while(c = getchar(), (c < '0' || c > '9') && c != '-');
    if(c == '-') flg = 1;
    else ret = c ^ 48;
    while( c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c ^ 48);
    return flg ? - ret : ret;
}

int mod;
typedef vector<LL> 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  + mod)% mod;
            }
        }
    }
    return C;
}

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

int main()
{
#ifdef LOCAL
    FIN;
#endif // LOCAL
    LL a, b, n;
    while (cin >> a >> b >> n >> mod)
    {
        mat A(2, vec(2));

        A[0][0] = 2 * a;  A[0][1] = b - a * a;
        A[1][0] = 1;      A[1][1] = 0;

        A = pow(A, n - 1);

        LL ans = ((2 * a * A[0][0] + 2 * A[0][1]) % mod + mod )% mod;

        printf("%d\n", ans);

    }
    return 0;
}