ural 1133. Fibonacci Sequence

题目链接： http://acm.timus.ru/problem.aspx?space=1&num=1133

problem description：

is an infinite sequence of integers that satisfies to Fibonacci condition F _i + 2 =  F _i + 1 +  F_i for any integer i. Write a program, which calculates the value of F_n for the given values of F_i and F_j.

Input

The input contains five integers in the following order: i, F_i, j, F_j, n.
−1000 ≤ i, j, n ≤ 1000, i ≠  j,
−2·10 ⁹ ≤ F_k ≤ 2·10 ⁹ ( k = min( i, j, n), …, max( i, j, n)).

Output

The output consists of a single integer, which is the value of F_n.

Sample

input	output
3 5 -1 4 5	12

Hint

In the example you are given: F ₃ = 5, F ₋₁ = 4; you asked to find the value of F ₅. The following Fibonacci sequence can be reconstructed using known values:

…, F ₋₁ = 4, F ₀ = −1, F ₁ = 3, F ₂ = 2, F ₃ = 5, F ₄ = 7, F ₅ = 12, …

Thus, the answer is: F ₅ = 12.

 

解题分析：

对于fibonacci序列a，X0，X1，X2。。。。。b。假设这个序列是存在的。X是代表哪些未知的数。要如何才能判断这个序列是有解的呢？

给定a，b的值。枚举x0然后去确定b的那个空要填什么数，如果该数等于b那么就找到了解。然而貌似每次这样循环找速度会很慢的。fibonaccig公式

f[i] = f[i-1] + f[i-2]  线性方程，可以用矩阵来优化求第n项。

[f[1], f[0]] *[ _{1¹ 0¹}] = [f[2], f[1]],  令unit = [ _{1¹  0}  ¹] , 求第n项，则先求矩阵ret = [f[1], f[0]] * unit^(n-1)

 1 def matrixMul(a, b):
 2     c = [[0 for i in xrange(2)] for j in xrange(2)]
 3     for i in xrange(2):
 4         for j in xrange(2):
 5             for k in xrange(2):
 6                 c[i][j] += a[i][k]*b[k][j]
 7     return c
 8 
 9 def POW(unit, x):
10     a = unit; b = [ [1, 0], [0, 1] ] 
11     while x>0:
12         if x&1:
13             b = matrixMul(b, a)
14         a = matrixMul(a, a)
15         x >>= 1
16     return b
17 
18 def work(i, a, j, b, n):
19     unit = [ [1, 1], [1, 0] ]
20     mat = POW(unit, j-1)
21     l = -2000000000; r = 2000000000; mid = -1
22     while l<=r:
23         mid =(l+r)>>1
24         tmp = mid*mat[0][0]+a*mat[1][0]
25         if tmp > b:  r = mid-1
26         elif tmp < b: l = mid+1
27         else :  break
28     mat = POW(unit, n-1)
29     print mid*mat[0][0]+a*mat[1][0] if n>0 else a
30     
31 if __name__ == '__main__':
32     i, a, j, b, n = map(int, raw_input().split())
33     if i > j:
34         tmp = i; i = j; j = tmp
35         tmp = a; a = b; b = tmp;
36     j -= i; n -= i; i=0
37     work(i, a, j, b, n)

View Code

 

转载于:https://www.cnblogs.com/TengXunGuanFangBlog/archive/2013/05/17/fibonacci_sequence.html