Fast Fibonacci problem

#1

Getting wrong answer

#2

@aiman.mumtaz,
Updated Code.

#3

Got timelimit for 1 testcases

#4

@aiman.mumtaz,
Try now, (made power function iterative rather than recursive)

#5

Hey in the compute function, why did you made T=power(T,n-2)?? We had to go to power of n-1 right?

#6

@aiman.mumtaz your initial code was correct only mistake was that ans will be T[0][0] not what you were calculating else everything is fine. look at this i have updated your code for same(https://ide.codingblocks.com/s/211372) look at line 35.