I think Dave is right and his solution also seems correct. Answer is 20KM i.e. 2 trips.
Good work @Dave. On Wed, Apr 6, 2011 at 7:43 PM, Dave <dave_and_da...@juno.com> wrote: > @Bittu: Actually, this is an easier problem than the Graham-Knowlton > Problem. It the GKP, you can only connect wires at one end and test at > the other. In this problem, this restriction is not given. The > algorithm I presented allows you to identify the wires with two one- > way trips by first connecting wires at one end and then connecting > them at the other end. > > Dave > > On Apr 5, 5:27 am, bittu <shashank7andr...@gmail.com> wrote: > > its the The Graham-Knowlton Problem in their paper this proble4ms i > > published is published > > > > goole it you will get answer & explanation > > > > Thanks & Regards > > Shashank Mani > > CSE, BIT Mesra > > -- > 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. > > -- Munish -- 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.
