Hey ankur sorry for the delay in response. For n demons and 1 sleeping man (initially) the answer goes like this :-
if n is odd (which is actually the case in given question coz n=65) then the man WOULD BE eaten. if n is even then man WONT BE eaten. For a more elaborate explanation kindly refer to http://quantfinanceinterviews.com/resources/sample1.pdf _dufus On Sep 14, 2:16 pm, ankur aggarwal <[email protected]> wrote: > @dufus > plz clearify > i know u have something in mind.. > > thanxs > > On Sun, Sep 13, 2009 at 11:26 PM, Dufus <[email protected]> wrote: > > > Old wine in new bottle. > > Try induction. > > > _dufus > > > On Sep 13, 10:23 pm, Dave <[email protected]> wrote: > > > Except that the craftiest demon only pretends to take a bite. When the > > > others fall asleep, he chows down. > > > > Dave > > > > On Sep 13, 7:24 am, jaspreet singh <[email protected]> > > > wrote: > > > > > the demons share the sleeping man amongst themselves.........and hence > > all > > > > fall asleep and cant eat each other either... > > > > > On Sun, Sep 13, 2009 at 5:42 PM, ankur aggarwal < > > [email protected]>wrote: > > > > > > nothing happens... > > > > > > On Sun, Sep 13, 2009 at 5:32 PM, Vikram Sridar < > > [email protected]>wrote: > > > > > >> The man lives forever... sleeps forever actually- 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 -~----------~----~----~----~------~----~------~--~---
