It is a *pair* of shoes, after all. Don On Jul 26, 2:16 am, subashree sridhar <[email protected]> wrote: > i think this problem can be solved easily for any no of ppl if they > are crossin the river using one shoe at a time :D :P > > On Jul 26, 10:38 am, sunny agrawal <[email protected]> wrote: > > > For N=3, if the people are named A,B, and C: > > > A wears the shoes and carries B across the river. > > is there any condition that one can carry only one with him? > > > On Tue, Jul 26, 2011 at 10:02 AM, Someshwar Chandrasekaran < > > > [email protected]> wrote: > > > On Tue, Jul 26, 2011 at 3:19 AM, Don <[email protected]> wrote: > > > > > How can the conditions be met for N=4? N=6? N=7? > > > > I believe this question cannot be solved for any values other than > > > three. The condition of wearing it only once makes it tricky. > > > > Regards, > > > B.C.Someshwar > > > > -- > > > 'Talk sense to a fool and he calls you foolish.' - Euripides > > > > My Blog: somsekaran.wordpress.com > > > > -- > > > You received this message because you are subscribed to the Google Groups > > > "Algorithm Geeks" group. > > > To post to this group, send email to [email protected]. > > > To unsubscribe from this group, send email to > > > [email protected]. > > > For more options, visit this group at > > >http://groups.google.com/group/algogeeks?hl=en. > > > -- > > Sunny Aggrawal > > B-Tech IV year,CSI > > Indian Institute Of Technology,Roorkee- Hide quoted text - > > > - Show quoted text - > >
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
