hdu 4565So Easy!（巧妙的矩阵快速幂）

So Easy!

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3849    Accepted Submission(s): 1266

Problem 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

  
  

   
   2 3 1 2013
2 3 2 2013
2 2 1 2013
  
  

 

Sample Output

  
  

   
   4
14
4
  
  

 

Source

2013 ACM-ICPC长沙赛区全国邀请赛——题目重现

 

Recommend

zhoujiaqi2010   |   We have carefully selected several similar problems for you:   5867  5866  5865  5864  5863 

/*
告诉你a,b,n,m,求

0<a,m<2^15 , (a-1)^2<b<a^2 , 0<b,n<2^31
解题思路：
我们首先对（a+sqrt(b))^n进行处理，由a+sqrt(b))^n的展开式我们可以知道
(a+sqrt(b))^n = Xn + Yn * sqrt(b);
那么
( a + sqrt( b ) )^( n + 1 ) = ( a + sqrt( b ) ) * ( Xn + Yn * sqrt(b) ) = ( a * Xn + b * Yn ) + ( a * Yn + Xn ) * sqrt( b );
则
Xn+1 = ( a * Xn + b * Yn )
Yn+1 = ( a * Yn + Xn )

所以

Xn = a * X0 + b * Y0;
Yn = X0 + a * Y0;

由于 (a-1)^2<b<a^2 ，
那么 0 < ( a - sqrt( b ) )^ n < 1
 又  ( a + sqrt( b ) )^ n + ( a - sqrt( b ) )^ n = 2 * Xn
那么 ( a + sqrt( b ) )^ n 向上取整的值就是 2 * Xn
最终
    Sn = （ 2 * Xn ）% m;
*/

#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
typedef long long ll;
struct matrix{
	ll mat[2][2];
};
matrix mul(matrix &a,matrix &b,ll mm)
{
	matrix c;
	for(int i=0;i<2;i++)
	{
		for(int j=0;j<2;j++)
		{
			c.mat[i][j]=0;
			for(int k=0;k<2;k++)
			{
				c.mat[i][j]+=(a.mat[i][k]*b.mat[k][j]);
			}
			c.mat[i][j]%=mm;
		}
	}
	return c;
}
matrix inti()
{
	matrix ans;
	for(int i=0;i<2;i++)
	{
		for(int j=0;j<2;j++)
		ans.mat[i][j]=(i==j);
	}
	return ans;
}
matrix ks(matrix a,ll k,ll mm)
{
	matrix ans=inti();
	while(k)
	{
		if(k&1)
		ans=mul(ans,a,mm);
		a=mul(a,a,mm);
		k>>=1;
	}
	return ans;
}
int main()
{
	matrix M;
	ll a,b,n;
	ll m;
	while(~scanf("%lld%lld%lld%lld",&a,&b,&n,&m))
	{
		M.mat[0][0]=a;
		M.mat[1][1]=a;
		M.mat[0][1]=b;
		M.mat[1][0]=1;
		matrix ans=ks(M,n,m);
		ll x=ans.mat[0][0];
		cout<<(2*x)%m<<endl;
	}
	return 0;
}