On Thu, Sep 15, 2011 at 4:44 PM, Blackwizard <[email protected]> wrote: > Hi > I want to solve this problem but I'm not sure about the algorithm... > I think It can be complete search... > Is the anybody to help me? > what's the algorithm for this question... > > Problem Link: > http://olympiads.win.tue.nl/ioi/ioi98/contest/day1/party/party.html
I think BFS should work, but then some pruning would be required since the number of lamps is large. I'm not sure how the pruning would be done though. > > > Thank's > > -- > 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. > > -- Gaurav Menghani -- 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.
