Hi guys. I need some help with this one. Suppose you deal with binary numbers with a fixed length. Given a set of "masks" how can I easily find a number that is not matched with a mask.
Example (length=3): 1** 0*0 001 and 011 are not matched. Every mask can only have 0's or 1's in it. So it isn't possible that a mask looks like this 0**1*0. Here is a more complex problem: ***1****11 **1*****11 *1******11 1*******1* ***1***1*1 *1*****1*1 1******1** 1*****1*** ***11****1 ***1*1***1 **1**1***1 ****00000* 0********0 0000****** Thanks for your help, Joerg --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
