hdu 4565 So Easy!

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
  
  
  
  

   
   题目分析： 
   
   
题目要求这个得值
   
   
但是取模前有更号，所以无法直接计算，我们发现
   
   
0< a, m < 215, (a-1)2< b < a2, 0 < b, n < 231

   
   
所以 0 <| a+sqrt( b ) | < 1
   
   
可得表达式：，由二项式展开可知等号右边一坨是整数并且加的数小于一，所以等式成立

   
   
然后我们设 Kn 为为等号的左边，将表达式化为递推形式后，再利用矩阵连乘来解决 Kn 的问题
   
   
转化过程就是移两次项，每次都将指数约去即可化简
   
   


   
   

   
   
# include<iostream>
# include<cstdio>
# include<cstring>
typedef __int64 ll;
using namespace std;
ll n,m,a,b;
struct node
{
   ll x[2][2];
} op;
node cheng(node a,node b)
{
    node t;
    int i,j,k;
    for (i=0;i<2;i++)
    for (j=0;j<2;j++)
    {
        ll sum=0;
        for (k=0;k<2;k++)
        sum=(sum+(ll)a.x[i][k]*b.x[k][j])%m;
        t.x[i][j]=sum;
    }
    return t;
}
int main()
{
    while (~scanf("%I64d%I64d%I64d%I64d",&a,&b,&n,&m))
    {
        ll x,y;
        x=(2*a)%m; y=(2*(a*a+b))%m;
        op.x[0][0]=(2*a)%m; op.x[0][1]=1;
        op.x[1][0]=((b-a*a%m)+m)%m;//不要掉了这里的+m 
        op.x[1][1]=0;
        if (n==1) { printf("%I64d\n",x); continue;};
        if (n==2) { printf("%I64d\n",y); continue;};
        node ans;
        ans=op;
        n=n-3;
        while (n)
        {
            if (n&1) op=cheng(op,ans);
            ans=cheng(ans,ans);
            n=n/2;
        }
        printf("%I64d\n",(op.x[0][0]*y+op.x[1][0]*x)%m);
    }
    return 0;
}