Lets say there is a river that is η meters wide. At every meter from the starting shore, there may or may not be a stone enough for frog to sit. Now a frog needs to cross the river. However the frog has the limitation that if it has just jumped x meters, then it can take next jump only of size x-1, x or x+1 meters. First jump can be of only 1 meter when starting from shore.
Assume frog can see all stone from this shore to opposite shore. Can frog determine whether it can make it to the other end or not.
Assume frog can see all stone from this shore to opposite shore. Can frog determine whether it can make it to the other end or not.
Following is implementation of above problem in c language.
Please write comments if you find anything wrong or you want to add something more related to this topic.
