It's done. Today I tried it. Simply for N=0 and N=1 answer is (0,0) = 0 and (1,1)=2 respectively.
For other cases, you can get the solution with fib(N+3). Starting fib(1) = 1, fib(2) = 1... Matrix Exponentiation, and Modulus for given constraints are necessary to pass the solution. On Mon, May 23, 2011 at 11:58 PM, sravanreddy001 <sravanreddy...@gmail.com>wrote: > @Dave,Balaji,Samby.. Without the matrix exponentiation, the time is not > possible, and without using the intermediate modulo operater as suggested by > Dave, the value cannot be accommodated, as the 300th fibinocci number alone > comes to > --> 222232244629420445529739893461909967206666939096499764990979600 > So, a mix of both are needed.. I'll try to look into this. > > any alternate solution you can think of? > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- -Aakash Johari (IIIT Allahabad) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
