I think Q1 is NP hard problem since the number of bits grows exponentially as the array size increases.
On Mon, Jan 17, 2011 at 1:13 PM, juver++ <avpostni...@gmail.com> wrote: > @awesomeandroid > Your solution for Q1 is wrong. It can be applied only for such numbers N = > 2^k, so number should power of 2. > > -- > 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<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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.
