SRM146 DIV1 600

枚举所有情况，依次判断情况是否合法，合法则计数器加一。这里的关键是给定secret和guess如何生成result

import re

def processResult(result):
    r = re.search('(d)b (d)w', result)
    b = int(r.group(1))    
    w = int(r.group(2))
    return (b, w)

def isvalid(x, guesses, results):
    lie = 0
    for i in range(0, len(guesses)):
        g = guesses[i]
        r = results[i]
        w = 0
        b = 0
        gflags = [False, False, False, False]
        xflags = [False, False, False, False]
        for j in range(0, 4):
            if x[j] == g[j]:
                b = b + 1
                xflags[j] = gflags[j] = True

        for j in range(0, 4):
            if not gflags[j]:
                for k in range(0, 4):
                    if not xflags[k] and g[j] == x[k]:
                        xflags[k] = True
                        w = w + 1
                        break

        if not (b == r[0] and w == r[1]):
            lie = lie + 1
            if lie > 1:
                return False

    if lie == 1:
        return True
    else:
        return False
    
class Masterbrain:
    def possibleSecrets(self, guesses, results):
        results = [processResult(x) for x in results]
        tot = 0
        for x0 in range(1, 8):
            for x1 in range(1, 8):
                for x2 in range(1, 8):
                    for x3 in range(1, 8):
                        x = str(x0 * 1000 + x1 * 100 + x2 * 10 + x3)
                        if isvalid(x, guesses, results):
                            tot = tot + 1

        return tot