adventOfCode2015/11-1.py at master · MaximeGoyette/adventOfCode2015 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
p = open('11.txt').read()

al = 'abcdefghijklmnopqrstuvwxyz'

def rule1(p):
    for i in xrange(len(p) - 2):
        if p[i] == p[i + 1] - 1 and p[i + 1] == p[i + 2] - 1:
            return True
    return False

def rule2(p):
    return not bool(set(p).intersection(set([8, 11, 14])))

def rule3(p):
    s = set()
    for i in xrange(len(p) - 1):
        if p[i] == p[i + 1]:
            s.add(p[i])
    return len(s) >= 2

def get_next(p):
    p[-1] += 1
    for i in xrange(len(p) - 1, 0, -1):
        if p[i] == len(al):
            p[i] = 0
            p[i - 1] += 1
    return p

def get_next_valid(p):
    p = [al.index(x) for x in p]
    p = get_next(p)
    while not rule2(p) or not rule1(p) or not rule3(p):
        p = get_next(p)
    return ''.join([al[i] for i in p])

print get_next_valid(p)