got it @ last sorry to disturb u guys if any one want answer feel free to ask
On Mon, May 9, 2011 at 10:41 PM, ArPiT BhAtNaGaR < arpitbhatnagarm...@gmail.com> wrote: > You're an electrician working at a mountain. There are N wires running from > one side of the mountain to the other. The problem is that the wires are not > labeled, so you just see N wire ends on each side of the mountain. Your job > is to match these ends (say, by labeling the two ends of each > wire in the same way). > > In order to figure out the matching, you can twist together wire ends, thus > electrically connecting the wires. You can twist as many wire ends as you > want, into as many clusters as you want, at the side of the mountain where > you happen to be at the time. You can also untwist the wire ends at the side > of the mountain where you're at. You are equipped with an Ohm meter, which > lets you test the connectivity of any pair of wires. (Actually, it's an > abstract Ohm meter, in that it only tells you whether or not two things are > connected, not the exact resistance.) > > You are not charged [no pun intended] for twisting, untwisting, and using > the Ohm meter. You are only charged for each helicopter ride you make from > one side of the mountain to the other. What is the best way to match the > wires? (Oh, N>2, for there is no solution when N=2.) > > -- > Thanks & Regards > > Arpit Bhatnagar > (Computer Engineering) > (MNIT JAIPUR) > > -- Thanks & Regards Arpit Bhatnagar (Computer Engineering) (MNIT JAIPUR) -- 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.
