Hi,

Let's see my solution,

Let N is the Total number of stones, and FJ ( N ) gives total number of ways
to reach

FJ ( N ) = FJ ( N-1 ) + FJ ( N-2) , if N > 2

            = 1                              , if N ==2 or N ==1

            = 0                               , if N == 0.

Regards,

Pradeep

  _____  

From: algogeeks@googlegroups.com [mailto:[EMAIL PROTECTED] On
Behalf Of Mahesh Gunda
Sent: Wednesday, February 13, 2008 10:58 AM
To: algogeeks@googlegroups.com
Subject: [algogeeks] Re: Frog Problem

 

easy solution.:)
I think everyone knows Fibonacci's series.

Mathematically..To reach K

No. Of ways to reach K 
                                          F(K) = F(K-1)+F(K-2)
                                                 =  F(J) + F(I)
                                                 = No. Of ways to reach J +
No. Of ways to reach I


I think u understood solution ...



--~--~---------~--~----~------------~-------~--~----~
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 [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to