yeah, i also need to know the approach for this kind of problems asked in many places
On Sun, Aug 7, 2011 at 3:58 PM, arvind kumar <arvindk...@gmail.com> wrote: > Hi > Can any1 pls help me in solving this? > Two persons are running on a circular track either in the same > direction or in the opposite direction, indefinitely. The speed of > both of them is given to you. Speed will be positive in clockwise > direction, and negative in anticlockwise direction. Print the number > of distinct points, at which they will meet on the circle. > > -- > 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. > > -- 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.
