So Easy!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
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!
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
15, (a-1)
2< b < a
2, 0 < b, n < 2
31.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 的问题
转化过程就是移两次项,每次都将指数约去即可化简,具体过程戳这里点击打开链接
AC:<pre name="code" class="cpp">#include <cstdio> #include <cstring> #include <cmath> #include <iostream> using namespace std; typedef __int64 ll; #define N 3 // 这里开大了超时,原来开的32 int K,mod; struct Matrix { int r,c; ll m[N][N]; Matrix(){} Matrix(int r,int c):r(r),c(c){} Matrix operator *(const Matrix& B) { Matrix T(r,B.c); for(int i=1;i<=T.r;i++) { for(int j=1;j<=T.c;j++) { ll tt = 0; for(int k=1;k<=c;k++) tt += m[i][k]*B.m[k][j] % mod; T.m[i][j] = tt % mod; } } return T; } Matrix Unit(int h) // 对角线矩阵 { Matrix T(h,h); memset(T.m,0,sizeof(T.m)); for(int i=1;i<=h;i++) T.m[i][i] = 1; return T; } Matrix Pow(int n) { Matrix P = *this,Res = Unit(r); while(n) { if(n&1) Res = Res*P; P = P*P; n >>= 1; } return Res; } void Print() { for(int i=1;i<=r;i++) { for(int j=1;j<=c;j++) printf("%d ",m[i][j]); printf("\n"); } } }Single; int main(){ freopen("in.txt","r",stdin); ll a,b,n; while(cin >> a >> b >> n >> mod){ Matrix p(2,2),ans(2,1); if(n==1){ cout << (2*a)%mod << endl; continue; } // 初始矩阵 ans.m[1][1] = (b + a*a%mod )%mod * 2 %mod; ans.m[2][1] = 2 * a %mod; // 操作矩阵 p.m[1][1] = ans.m[2][1]; p.m[1][2] = (b-a*a %mod +mod)%mod; p.m[2][1] = 1; p.m[2][2] = 0; ans = p.Pow(n-2) * ans; cout << ans.m[1][1] << endl; } return 0; }