HDU 4565 So Easy!

最新推荐文章于 2020-02-07 11:05:28 发布

TouchDreamer

最新推荐文章于 2020-02-07 11:05:28 发布

阅读量818

点赞数 1

分类专栏： ACM_HDU ------------数学---------------- 数学_矩阵快速幂

本文链接：https://blog.csdn.net/chen_ze_hua/article/details/52072732

版权

ACM_HDU 同时被 3 个专栏收录

158 篇文章 0 订阅

订阅专栏

------------数学----------------

16 篇文章 0 订阅

订阅专栏

数学_矩阵快速幂

8 篇文章 0 订阅

订阅专栏

题目分析

S n = ⌈ (a + b \sqrt) n ⌉ % m

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

因为 $(a-1)^2 < b < a^2$ ,所以 $0<(a - \sqrt{b})^n<1$ ,因此 $S_n = \lceil(a+\sqrt{b})^n+(a-\sqrt{b})^n\rceil \% m$

接下来我们证明 $S_n = 2*a*S_{n-1} + (b-a^2)S_{n-2}$ 。

$S n = (a + b \sqrt) n + (a - b \sqrt) n; S n - 1 = (a + b \sqrt) n - 1 + (a - b \sqrt) n - 1; 移项得 : S n - ( a - b \sqrt ) n S n - 1 - ( a - b \sqrt ) n - 1 = a + b \sqrt; S n - (a - b \sqrt) n = (a + b \sqrt) * S n - 1 - (a + b \sqrt) * (a - b \sqrt) n - 1; S n = (a + b \sqrt) * S n - 1 - 2 * a * (a - b \sqrt) n - 1; S n - 1 = (a + b \sqrt) * S n - 2 - 2 * a * (a - b \sqrt) n - 2; S n - ( a + b \sqrt ) * S n - 1 S n - 1 - ( a + b \sqrt ) * S n - 2 = a - b \sqrt 化简得 : S n = 2 * a * S n - 1 + (b - a 2) * S n - 2;$ $S_n = (a+\sqrt{b})^n + (a-\sqrt{b})^n; \\S_{n-1} = (a+\sqrt{b})^{n-1} + (a-\sqrt{b})^{n-1}; \\移项得:\frac{S_n-(a-\sqrt{b})^n}{S_{n-1}-(a-\sqrt{b})^{n-1}} = a+\sqrt{b}; \\S_n - (a-\sqrt{b})^n= (a+\sqrt{b})*S_{n-1}-(a+\sqrt{b})*(a-\sqrt{b})^{n-1}; \\S_n = (a+\sqrt{b})*S_{n-1}-2*a*(a-\sqrt{b})^{n-1}; \\ S_{n-1}=(a+\sqrt{b})*S_{n-2}-2*a*(a-\sqrt{b})^{n-2}; \\ \frac{S_n-(a+\sqrt{b})*S_{n-1}}{S_{n-1}-(a+\sqrt{b})*S_{n-2}} = a-\sqrt{b} \\ 化简得:S_n =2*a*S_{n-1}+(b-a^2)*S_{n-2};$
有上述的推导式子很明显可以推导出一个矩阵，然后利用矩阵快速幂求解即可。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
LL a,b,n,m;

struct Matirx{
    int r,c;
    LL matirx[2][2];
};

Matirx one, start, another;

Matirx Mul(Matirx a, Matirx b){  //矩阵乘法
    Matirx c;
    c.r = a.r;
    c.c = b.c;
    for(int i = 0; i < a.r; i++){
        for(int j = 0; j < b.c; j++){
            c.matirx[i][j] = 0;
            for(int k = 0; k < a.c; k++)
                c.matirx[i][j] += a.matirx[i][k]*b.matirx[k][j];
            c.matirx[i][j] %= m;
        }
    }
    return c;
}

Matirx Quick_pow(int n){     //矩阵快速幂
    Matirx ret = one, temp = start;
    while(n){
        if(n&1) ret = Mul(ret, temp);
        temp = Mul(temp, temp);
        n >>= 1;
    }
    return ret;
}

void init(){ //初始化
    one.r = one.c = start.c = start.r = 2;
    one.matirx[0][0] = 1;
    one.matirx[0][1] = 0;
    one.matirx[1][0] = 0;
    one.matirx[1][1] = 1;
    start.matirx[0][0] = 0;
    start.matirx[0][1] = 1;
    start.matirx[1][0] = b-a*a;
    start.matirx[1][1] = 2*a;
    another.r = 2;
    another.c = 1;
    another.matirx[0][0] = 2*a;
    another.matirx[1][0] = 2*(a*a+b);
}

int main(){
    while(scanf("%I64d%I64d%I64d%I64d", &a, &b, &n, &m) != EOF){
        init();
        if(n == 1) printf("%I64d\n", (2*a)%m);
        else if(n == 2) printf("%I64d\n", (2*(a*a+b))%m);
        else {
            Matirx ret = Quick_pow(n-2);
            another = Mul(ret, another);
            printf("%I64d\n", (another.matirx[1][0]+m)%m); //这里一定要注意,因为构建start矩阵时你会发现b-a*a为负数，因此可能会出现负值
        }
    }
    return 0;
}