HDU 4565 So Easy!（数学+矩阵快速幂）

最新推荐文章于 2020-07-01 15:59:25 发布

Who_is_WZX

最新推荐文章于 2020-07-01 15:59:25 发布

阅读量536

点赞数

分类专栏：数学 acm 矩阵乘法

本文链接：https://blog.csdn.net/qq397470071/article/details/10179367

版权

acm 同时被 3 个专栏收录

41 篇文章 0 订阅

订阅专栏

数学

13 篇文章 0 订阅

订阅专栏

矩阵乘法

1 篇文章 0 订阅

订阅专栏

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u

Submit Status Practice HDU 4565

Description

　　A sequence S _n is defined as:

Where a, b, n, m are positive integers.┌x┐is the ceil of x. For example, ┌3.14┐=4. You are to calculate S _n.
　　You, a top coder, say: So easy!

Input

　　There are several test cases, each test case in one line contains four positive integers: a, b, n, m. Where 0< a, m < 2 ¹⁵, (a-1) ²< b < a ², 0 < b, n < 2 ³¹.The input will finish with the end of file.

Output

　　For each the case, output an integer S _n.

Sample Input

Sample Output

思路：

http://www.klogk.com/posts/hdu4565/

代码：

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define LL long long

LL A,B,n,m;

struct Mat{
	LL num[2][2];
	Mat(LL x1=0,LL x2=0,LL x3=0,LL x4=0){
		num[0][0]=x1; num[0][1]=x2;
		num[1][0]=x3; num[1][1]=x4;
	}
};
Mat unit=Mat(1,0,0,1);
Mat operator*(const Mat &a,const Mat &b){
	Mat c;
	for (long i=0;i<2;++i)
		for (long j=0;j<2;++j)
			for (long k=0;k<2;++k)
				c.num[i][j]=(c.num[i][j]+a.num[i][k]*b.num[k][j]+m)%m;
	return c;
}
Mat operator^(const Mat &a,LL n){
	Mat c=unit,temp=a;
	while (n){
		if (n%2) c=temp*c;
		temp=temp*temp;
		n/=2;
	}
	return c;
}

Mat wtf;
long ans[2];
int main(){
	while (~scanf("%I64d%I64d%I64d%I64d",&A,&B,&n,&m)){
		ans[0]=2*A;
		ans[1]=2;

		wtf=Mat(2*A,-(A*A-B),1,0);
		wtf=wtf^(n-1);
		long temp=0;
		for (long i=0;i<2;++i)
			temp=(temp+ans[i]*wtf.num[0][i]+m)%m;
		printf("%d\n",temp);
	}
	return 0;
}