Anyone has idea about
http://www.cs.helsinki.fi/group/boi2006/tasks/bitwise.pdf
Surely greedy works here: if we know we can set bit k in all the clauses,
then we set it regardless what happens for bits < k, this was as far as
I could get.
--
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.
