[hdu4565][矩阵乘法]So Easy!

So Easy!

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

Problem Description
　　A sequence Sn 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 Sn.
　　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 < 215, (a-1)2< b < a2, 0 < b, n < 231.The input will finish with the end of file.

Output
　　For each the case, output an integer Sn.

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

sol:

和hdu2256差不多，不过这题不是常数版本
随便推一下发现xn=a xn-1 +b yn-1,yn=x+ayn-1，显然不能直接这样上取整然后mod。考虑做加减，(a+sqrt(b))^n+(a-sqrt(b))^n=2xn
又a-sqrt(b)<1,题目要求的式子+一个很小的数=2xn,上取整后显然是2xn.直接矩乘即可

talk is cheap,but no code.