Question:codility Ladder Question
My Answer:
def solution(A,B):
ladder = max(A)
maxB = max(B)
fib = [0] * (ladder + 2)
fib[1] = 1
for i in range(2,ladder + 2):
fib[i] = ((fib[i - 1] + fib[i - 2]) & ((1 << maxB) - 1))
res = [0] * len(A)
for i in range(len(A)):
res[i] = fib[A[i] + 1] & ((1 << B[i]) - 1)
return res