Discussion @ 1133. Fibonacci Sequence @ Timus Online Judge

I solve recurrence equation by using characteristic equation

Posted by BigBin 22 Jul 2008 23:16

I solve recurrence equation by using characteristic equation

F(n) = c1*pow(Phi, n) + c2*pow(phi, n); by

c2 = ( fp*pow(Phi, q) - fq*pow(Phi, p) )/( pow(Phi, q)*pow(phi, p) - pow(Phi, p)*pow(phi, q) );
c1 = ( fq - c2*pow(phi, q) ) / pow(Phi, q);

i use long double to keep and round the answer but i got WA in test case 12. Anyone can help me please?

Re: I solve recurrence equation by using characteristic equation

Posted by wrbuaa2005 4 Sep 2008 14:13

Me too.. but why???

Discussion of Problem 1133. Fibonacci Sequence