[python] simple bitmask
Emureate all the possible good people and check if the enumerate is correct.\n\nAn enumeration is correct if good people\'s statement are true. \n\nclass Soluti
Emureate all the possible good people and check if the enumerate is correct.\n\nAn enumeration is correct if good people\'s statement are true. \n```\nclass Solution:\n    def maximumGood(self, A: List[List[int]]) -> int:\n        \n        ans = 0\n        for i in range(1 << len(A))[::-1]:\n            \n            # enumerate the ppl who told the truth\n            good = []\n            for j in range(len(A)):\n                if i & (1 << j):\n                    good.append(j)\n            \n            # check conflict \n            count = self.get_count(A, good)\n            \n            ans = max(ans, count)\n        \n        return ans\n    \n    def get_count(self, graph, good):\n        \n        for g in good:\n            for nei, st in enumerate(graph[g]):\n                if st == 2:\n                    continue\n                elif st == 1:\n                    # nei should be good\n                    if nei not in good:\n                        return 0\n                elif st == 0:\n                    # nei should not be in good\n                    if nei in good:\n                        return 0\n        return len(good)\n```
['Bitmask']