For Dance Floor: 1)Note that the order in which you tap tiles is unimportant. 2)Try all subsets(or combinations) of tapping tiles on the first row,then in the other rows we only need to tap when the tile directly above is not lit. 3)Base condition will be when you finish with the last row,then the check if the last row contains all lit ones..
On Tue, Aug 23, 2011 at 4:47 AM, Victor Manuel Grijalva Altamirano < kavic1.mar...@gmail.com> wrote: > I am trying the problem http://www.spoj.pl/problems/CERC07B/ and > http://www.spoj.pl/problems/DFLOOR/ but i don´t have idea how to solve, > anyone can help me??? > > -- > Victor Manuel Grijalva Altamirano > Universidad Tecnologica de La Mixteca > > -- > 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. > -- *Regards,* *Piyush Kapoor,* *2nd year,CSE IT-BHU* -- 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.
