fibonacci/fib_challenge.py

24 lines
480 B
Python

#!/usr/bin/env python3
def fib(n):
if n >= 0:
return fibiter(1, 0, 0, 1, n)
if n < 0:
a, b = 0, 1
for _ in range(0, n, -1):
a, b = b - a, a
return a
def fibiter(a, b, p, q, count):
if count == 0:
return b
if count % 2 == 0:
return fibiter(a, b, p * p + q * q, q * q + 2 * p * q, count / 2)
else:
return fibiter(b * q + a * q + a * p, b * p + a * q, p, q, count - 1)
print(fib(1000000))