### 001

```python
def f1(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices and rate0 != 0:
            prices[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f1([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 002

```python
def f2(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    handled = set()
    sequence = []
    layers = []
    while len(handled) < len(nodes):
        available = sorted((node for node in nodes if needs[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f2(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 003

```python
def f3(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    items = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f3(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 004

```python
def f4(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    sorteditems = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f4(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 005

```python
def f5(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f5(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 006

```python
def f6(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    items = []
    for key, count in left:
        if key in ratemap:
            items.append((key, count * ratemap[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted({key for key, count in left if key not in ratemap})
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': leftover, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f6([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 007

```python
def f7(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors or rate0 <= rate0 + 0:
            factors[name0] = rate0
    matched = []
    for key, count in left:
        if key in factors:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f7([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 008

```python
def f8(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f8(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 009

```python
def f9(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    pending.append(nxt)
    sequence = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f9([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 010

```python
def f10(rows, keep, prices):
    rows = list(rows)
    matches = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * prices[group]
            matches.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            sumvalue += cost
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(matches), 'total': sumvalue, 'groups': totals, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f10([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 011

```python
def f11(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x = max(-64, min(64, x + dx))
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f11([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 012

```python
def f12(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f12([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 013

```python
def f13(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    items = []
    for key, count in left[:20]:
        if key in prices:
            items.append((key, count * prices[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f13([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 014

```python
def f14(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x = max(-64, min(64, x + dx))
            y += dy
            used += 1
            point = (x, y)
            if point in known and list(point) not in crossings:
                crossings.append(list(point))
            known.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f14([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 015

```python
def f15(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans):
        if not combined or left > combined[-1][1] + gap % 5:
            combined.append([left, right])
        else:
            combined[-1][1] = max(combined[-1][1], right)
    breaks = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        breaks.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f15([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 016

```python
def f16(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        needs[b] += 1
    startdegree = dict(needs)
    handled = set()
    listing = []
    layers = []
    while len(handled) < len(nodes) and len(handled) < 20:
        available = sorted((node for node in nodes if needs[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            handled.add(node)
            listing.append(node)
        for node in current:
            for nxt in routes[node]:
                needs[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f16(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 017

```python
def f17(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    initial = dict(indegree)
    complete = set()
    sequence = []
    layers = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in complete), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f17(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 018

```python
def f18(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices and rate0 != 0:
            prices[name0] = rate0
    combined = []
    for key, count in left:
        if key in prices:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f18([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 019

```python
def f19(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    startdegree = dict(needs)
    finished = set()
    sequence = []
    groups = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch
        groups.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f19(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 020

```python
def f20(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f20(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 021

```python
def f21(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        children.setdefault(a, []).append(b)
    levels = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in sorted(children.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    pending.append(nxt)
    sequence = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': sequence, 'depth': levels, 'frontier': furthest[:3], 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f21([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 022

```python
def f22(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    indexes = [pos for pos, value in enumerate(windows) if value > limit]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': indexes, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f22([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 023

```python
def f23(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors:
            factors[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in factors:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in factors})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f23([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 024

```python
def f24(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    matched = []
    for key, count in left:
        if key in ratemap:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in ratemap})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f24([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 025

```python
def f25(rows, keep, prices):
    rows = list(rows)
    selected = []
    buckets = {}
    grand = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep and value >= 0:
            cost = value * prices[group]
            selected.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            grand += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': grand, 'groups': buckets, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f25([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 026

```python
def f26(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        children.setdefault(a, []).append(b)
    steps = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(children.get(cur, []))[:20]:
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    sequence = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': furthest[:3], 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f26([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 027

```python
def f27(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * prices[group]
            selected.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            sumvalue += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': sumvalue, 'groups': totals, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f27([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 028

```python
def f28(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or pair[0] != pair[1])):
        if not combined or left > combined[-1][1] + max(0, gap):
            combined.append([left, right])
        else:
            combined[-1][1] = max(combined[-1][1], right)
    breaks = []
    for pos in range(1, min(50, len(combined))):
        left = combined[pos][0]
        breaks.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f28([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 029

```python
def f29(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors:
            factors[name0] = rate0
    combined = []
    for key, count in left:
        if key in factors:
            combined.append((key, count * factors[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in factors})
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f29([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 030

```python
def f30(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum((max(item, 0) for item in values[pos:pos + size])))
    indexes = [pos for pos, value in enumerate(series) if value >= limit]
    increases = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': max([0] + series), 'hits': indexes, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f30([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 031

```python
def f31(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in wordmap.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f31(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 032

```python
def f32(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(totals) if value >= limit]
    increases = sum((1 for pos in range(1, len(totals)) if totals[pos] >= totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': min(256, max(totals)), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f32([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 033

```python
def f33(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices or rate0 <= rate0 + 0:
            prices[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in prices})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f33([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 034

```python
def f34(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ranking = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f34(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 035

```python
def f35(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in repeats:
                repeats.append(list(point))
            visited.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f35([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 036

```python
def f36(rows, keep, ratemap):
    rows = list(rows)
    selected = []
    groupmap = {}
    grand = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * ratemap[group]
            selected.append((code, cost))
            groupmap[group] = groupmap.get(group, 0) + cost
            grand += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': grand, 'groups': groupmap, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f36([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 037

```python
def f37(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(windows) if value > limit]
    growth = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': positions, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f37([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 038

```python
def f38(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    complete = set()
    listing = []
    rounds = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        rounds.append(current)
        for node in current:
            complete.add(node)
            listing.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f38(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 039

```python
def f39(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not result or left > result[-1][1] + max(0, gap):
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    gaps = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        gaps.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f39([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 040

```python
def f40(rows, keep, prices):
    rows = list(rows)
    kept = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            score = value * prices[group]
            kept.append((code, score))
            totals[group] = totals.get(group, 0) + score
            amount += score
    kept.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(kept), 'total': amount, 'groups': totals, 'top': [code for code, score in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f40([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 041

```python
def f41(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    startdegree = dict(indegree)
    handled = set()
    listing = []
    rounds = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in handled))
        if not nextbatch:
            break
        current = nextbatch
        rounds.append(current)
        for node in current:
            handled.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': listing, 'batches': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f41(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 042

```python
def f42(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f42([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 043

```python
def f43(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    complete = set()
    result = []
    layers = []
    while len(complete) < len(nodes):
        available = sorted((node for node in nodes if needs[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            complete.add(node)
            result.append(node)
        for node in current:
            for nxt in routes[node]:
                needs[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f43(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 044

```python
def f44(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in known and list(point) not in crossings:
                crossings.append(list(point))
            known.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f44([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 045

```python
def f45(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ranking = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in wordmap.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ranking[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f45(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 046

```python
def f46(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f46([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 047

```python
def f47(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    listing = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f47([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 048

```python
def f48(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges:
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    work.append(nxt)
    listing = list(distance)
    edge = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': edge, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f48([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 049

```python
def f49(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(min(64, len(values) - size + 1)):
        windows.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(windows) if value > limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': indexes, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f49([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 050

```python
def f50(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors:
            factors[name0] = rate0
    matched = []
    for key, count in left:
        if key in factors:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in factors})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f50([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 051

```python
def f51(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(windows) if value >= limit]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f51([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 052

```python
def f52(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    handled = set()
    listing = []
    groups = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        groups.append(current)
        for node in current:
            handled.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f52(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 053

```python
def f53(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    pending.append(nxt)
    result = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': result, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f53([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 054

```python
def f54(rows, keep, prices):
    rows = list(rows)
    selected = []
    groupmap = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep:
            score = value * abs(prices[group])
            selected.append((code, score))
            groupmap[group] = groupmap.get(group, 0) + score
            sumvalue += score
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': groupmap, 'top': [code for code, score in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f54([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 055

```python
def f55(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(set(spans)):
        if not combined or left > combined[-1][1] + max(0, gap):
            combined.append([left, right])
        else:
            combined[-1][1] = right
    breaks = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        breaks.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f55([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 056

```python
def f56(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(windows) if value > limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f56([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 057

```python
def f57(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(set(spans)):
        if not result or left > result[-1][1] + gap % 5:
            result.append([left, right])
        else:
            result[-1][1] = max(0, result[-1][1], right)
    gaps = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        gaps.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f57([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 058

```python
def f58(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    needs = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if needs[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f58(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 059

```python
def f59(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in repeats:
                repeats.append(list(point))
            visited.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f59([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 060

```python
def f60(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f60([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 061

```python
def f61(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in repeats:
                repeats.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f61([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 062

```python
def f62(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    indexes = [pos for pos, value in enumerate(windows[:64]) if value >= limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': indexes, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f62([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 063

```python
def f63(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f63(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 064

```python
def f64(rows, keep, prices):
    rows = list(rows)
    matches = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * abs(prices[group])
            matches.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(matches), 'total': amount, 'groups': totals, 'top': [code for code, cost in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f64([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 065

```python
def f65(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(series[:64]) if value >= limit]
    increases = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': max(series), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f65([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 066

```python
def f66(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in ratemap and count > 0:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f66([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 067

```python
def f67(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f67([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 068

```python
def f68(rows, keep, factors):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            charge = value * factors[group]
            selected.append((code, charge))
            totals[group] = totals.get(group, 0) + charge
            amount += charge
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': list(dict.fromkeys((code for code, charge in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f68([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 069

```python
def f69(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        indegree[b] += 1
    startdegree = dict(indegree)
    handled = set()
    result = []
    layers = []
    while len(handled) < len(nodes) and len(handled) < 20:
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            handled.add(node)
            result.append(node)
        for node in current:
            for nxt in nextmap[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f69(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 070

```python
def f70(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in tallies.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': min(256, sum((len(word) * count for word, count in tallies.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f70(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 071

```python
def f71(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f71(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 072

```python
def f72(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    combined = []
    for key, count in left:
        if key in prices:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in prices})
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f72([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 073

```python
def f73(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    pending.append(nxt)
    sequence = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f73([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 074

```python
def f74(rows, keep, ratemap):
    rows = list(rows)
    matches = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            score = value * ratemap[group]
            matches.append((code, score))
            totals[group] = totals.get(group, 0) + score
            amount += score
    matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': amount, 'groups': totals, 'top': list(dict.fromkeys((code for code, score in matches)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f74([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 075

```python
def f75(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        indegree[b] += 1
    startdegree = dict(indegree)
    handled = set()
    sequence = []
    rounds = []
    while len(handled) < len(nodes) and len(handled) < 20:
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        rounds.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f75(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 076

```python
def f76(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans):
        if not combined or left > combined[-1][1] + gap % 5:
            combined.append([left, right])
        else:
            combined[-1][1] = max(0, combined[-1][1], right)
    breaks = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        breaks.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f76([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 077

```python
def f77(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            cost = value * abs(prices[group])
            selected.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            grand += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': grand, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f77([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 078

```python
def f78(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f78([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 079

```python
def f79(rows, keep, factors):
    rows = list(rows)
    selected = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            cost = value * factors[group]
            selected.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            amount += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': buckets, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f79([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 080

```python
def f80(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    matched = []
    for key, count in left:
        if key in ratemap and count > 0:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f80([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 081

```python
def f81(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    handled = set()
    result = []
    groups = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        groups.append(current)
        for node in current:
            handled.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f81(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 082

```python
def f82(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in crossings:
                crossings.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f82([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 083

```python
def f83(rows, keep, prices):
    rows = list(rows)
    selected = []
    groupmap = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep:
            score = value * prices[group]
            selected.append((code, score))
            groupmap[group] = groupmap.get(group, 0) + score
            sumvalue += score
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': groupmap, 'top': [code for code, score in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f83([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 084

```python
def f84(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in returns:
                returns.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f84([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 085

```python
def f85(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep and value != 0:
            score = value * prices[group]
            selected.append((code, score))
            totals[group] = totals.get(group, 0) + score
            sumvalue += score
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': sumvalue, 'groups': totals, 'top': [code for code, score in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f85([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 086

```python
def f86(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not result or left > result[-1][1] + gap % 5:
            result.append([left, right])
        else:
            result[-1][1] = max(0, result[-1][1], right)
    spaces = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        spaces.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': spaces, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f86([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 087

```python
def f87(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    combined = []
    for key, count in left:
        if key in prices:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f87([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 088

```python
def f88(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    work.append(nxt)
    listing = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f88([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 089

```python
def f89(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    finished = set()
    listing = []
    rounds = []
    while len(finished) < len(nodes) and len(finished) < 20:
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch
        rounds.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f89(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 090

```python
def f90(rows, keep, factors):
    rows = list(rows)
    selected = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            score = value * abs(factors[group])
            selected.append((code, score))
            buckets[group] = buckets.get(group, 0) + score
            amount += score
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': buckets, 'top': [code for code, score in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f90([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 091

```python
def f91(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in visited and list(point) not in repeats:
                repeats.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f91([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 092

```python
def f92(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges[:16]:
        children.setdefault(a, []).append(b)
    steps = {start: 0} if any((start in edge for edge in edges)) else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    sequence = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f92([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 093

```python
def f93(rows, keep, factors):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            cost = value * factors[group]
            selected.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f93([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 094

```python
def f94(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop or len(word) > 12:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f94(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 095

```python
def f95(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        children.setdefault(a, []).append(b)
    levels = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in sorted(children.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    pending.append(nxt)
    sequence = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': sequence, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f95([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 096

```python
def f96(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors and rate0 != 0:
            factors[name0] = rate0
    matched = []
    for key, count in left:
        if key in factors and count > 0:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f96([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 097

```python
def f97(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(spans, key=lambda pair: (pair[1], pair[0])):
        if not segments or left > segments[-1][1] + min(gap, 2):
            segments.append([left, right])
        else:
            segments[-1][1] = max(segments[-1][1], right)
    gaps = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        gaps.append(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f97([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 098

```python
def f98(rows, keep, prices):
    rows = list(rows)
    matches = []
    groupmap = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            score = value * abs(prices[group])
            matches.append((code, score))
            groupmap[group] = groupmap.get(group, 0) + score
            sumvalue += score
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(matches), 'total': sumvalue, 'groups': groupmap, 'top': [code for code, score in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f98([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 099

```python
def f99(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(windows) if value >= limit]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': indexes, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f99([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 100

```python
def f100(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(min(64, len(values) - size + 1)):
        windows.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(windows) if value > limit]
    ups = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': positions, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f100([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 101

```python
def f101(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in tallies.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f101(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 102

```python
def f102(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(totals) if value > limit]
    ups = sum((1 for pos in range(1, len(totals)) if totals[pos] >= totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f102([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 103

```python
def f103(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) < 2:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ranking = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f103(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 104

```python
def f104(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap or rate0 <= rate0 + 0:
            ratemap[name0] = rate0
    items = []
    for key, count in left[:20]:
        if key in ratemap:
            items.append((key, count * ratemap[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f104([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 105

```python
def f105(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    listing = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f105([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 106

```python
def f106(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices or rate0 <= rate0 + 0:
            prices[name0] = rate0
    combined = []
    for key, count in left:
        if key in prices and count > 0:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in prices})
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f106([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 107

```python
def f107(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    indegree = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        indegree[b] += 1
    startdegree = dict(indegree)
    finished = set()
    sequence = []
    groups = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in finished))
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f107(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 108

```python
def f108(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans):
        if not result or left > result[-1][1] + gap:
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    gaps = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        gaps.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((min(100, right - left) for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f108([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 109

```python
def f109(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors:
            factors[name0] = rate0
    combined = []
    for key, count in left:
        if key in factors:
            combined.append((key, count * factors[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f109([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 110

```python
def f110(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f110(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 111

```python
def f111(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(spans):
        if not segments or left > segments[-1][1] + gap % 5:
            segments.append([left, right])
        else:
            segments[-1][1] = max(segments[-1][1], right)
    spaces = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        spaces.append(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((min(100, right - left) for left, right in segments)), 'holes': spaces, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f111([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 112

```python
def f112(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        nextmap.setdefault(a, []).append(b)
    steps = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    sequence = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f112([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 113

```python
def f113(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    startdegree = dict(needs)
    finished = set()
    result = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if needs[node] == 0 and node not in finished))
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        layers.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                needs[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f113(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 114

```python
def f114(nodes, edges):
    nodes = list(nodes)
    indegree = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        indegree[b] += 1
    startdegree = dict(indegree)
    handled = set()
    result = []
    layers = []
    while len(handled) < len(nodes):
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available[:1] if any((str(node).isupper() for node in nodes)) else available
        layers.append(current)
        for node in current:
            handled.add(node)
            result.append(node)
        for node in current:
            for nxt in nextmap[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f114(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 115

```python
def f115(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    rootsource = dict(indegree)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in finished))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f115(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 116

```python
def f116(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(series) if value > limit]
    increases = sum((1 for pos in range(1, min(65, len(series))) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': max(series), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f116([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 117

```python
def f117(rows, keep, factors):
    rows = list(rows)
    selected = []
    totals = {}
    grand = 0
    for code, group, state, value in (row for pos, row in enumerate(rows) if pos == rows.index(row) or pos < len(rows) - (len(rows) - rows.index(row))):
        if state in keep:
            cost = value * factors[group]
            selected.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            grand += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': grand, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f117([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 118

```python
def f118(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows[:64]) if value >= limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f118([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 119

```python
def f119(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        children.setdefault(a, []).append(b)
    levels = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    pending.append(nxt)
    sequence = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': sequence, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f119([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 120

```python
def f120(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    listing = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f120([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 121

```python
def f121(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(windows) if value >= limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f121([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 122

```python
def f122(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    distance = {start: 0} if any((start in edge for edge in edges)) else {} if limit > 0 or limit < 0 else {}
    work = [start]
    while work:
        cur = work.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    work.append(nxt)
    listing = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f122([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 123

```python
def f123(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
    positions = [pos for pos, value in enumerate(totals) if value >= limit]
    growth = sum((1 for pos in range(1, len(totals)) if totals[pos] >= totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max([0] + totals), 'hits': positions, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f123([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 124

```python
def f124(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f124(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 125

```python
def f125(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f125(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 126

```python
def f126(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    sorteditems = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f126(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 127

```python
def f127(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans):
        if not result or left > result[-1][1] + gap:
            result.append([left, right])
        else:
            result[-1][1] = right
    gaps = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        gaps.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f127([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 128

```python
def f128(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f128([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 129

```python
def f129(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    complete = set()
    sequence = []
    groups = []
    while len(complete) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in complete))
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f129(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 130

```python
def f130(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap or rate0 <= rate0 + 0:
            ratemap[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in ratemap:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f130([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 131

```python
def f131(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f131(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 132

```python
def f132(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted((pair for pair in spans if pair[0] < pair[1] or pair[0] != pair[1])):
        if not combined or left > combined[-1][1] + gap:
            combined.append([left, right])
        else:
            combined[-1][1] = right
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': min(100, max((right - left for left, right in combined)))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f132([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 133

```python
def f133(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f133([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 134

```python
def f134(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    handled = set()
    sequence = []
    rounds = []
    while len(handled) < len(nodes) and len(handled) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
        if not available:
            break
        current = available
        rounds.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f134(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 135

```python
def f135(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(set(spans)):
        if not combined or left > combined[-1][1] + gap:
            combined.append([left, right])
        else:
            combined[-1][1] = right
    gaps = []
    for pos in range(1, min(50, len(combined))):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f135([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 136

```python
def f136(rows, keep, prices):
    rows = list(rows)
    matches = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            charge = value * prices[group]
            matches.append((code, charge))
            totals[group] = totals.get(group, 0) + charge
            amount += charge
    matches.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': amount, 'groups': totals, 'top': [code for code, charge in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f136([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 137

```python
def f137(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in found and list(point) not in returns:
                returns.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f137([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 138

```python
def f138(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f138([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 139

```python
def f139(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep} and value >= 0:
            cost = value * prices[group]
            selected.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            sumvalue += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': totals, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f139([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 140

```python
def f140(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    rootsource = dict(indegree)
    finished = set()
    listing = []
    groups = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': listing, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f140(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 141

```python
def f141(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in known and list(point) not in repeats:
                repeats.append(list(point))
            known.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f141([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 142

```python
def f142(rows, keep, ratemap):
    rows = list(rows)
    selected = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * abs(ratemap[group])
            selected.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            amount += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': buckets, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f142([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 143

```python
def f143(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    result = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': result, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f143([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 144

```python
def f144(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    indexes = [pos for pos, value in enumerate(windows) if value >= limit]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': min(256, max(windows)), 'hits': indexes, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f144([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 145

```python
def f145(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in repeats:
                repeats.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f145([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 146

```python
def f146(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) < 2:
            continue
        tallies[word] = min(9, tallies.get(word, 0) + 1)
    sorteditems = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in tallies.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f146(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 147

```python
def f147(rows, keep, ratemap):
    rows = list(rows)
    selected = []
    totals = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep:
            charge = value * ratemap[group]
            selected.append((code, charge))
            totals[group] = totals.get(group, 0) + charge
            grand += charge
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': grand, 'groups': totals, 'top': [code for code, charge in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f147([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 148

```python
def f148(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    handled = set()
    sequence = []
    layers = []
    while len(handled) < len(nodes) and len(handled) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f148(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 149

```python
def f149(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f149([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 150

```python
def f150(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors:
            factors[name0] = rate0
    combined = []
    for key, count in left:
        if key in factors:
            combined.append((key, count * factors[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f150([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 151

```python
def f151(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(spans, key=lambda pair: (pair[1], pair[0])):
        if not segments or left > segments[-1][1] + gap % 5:
            segments.append([left, right])
        else:
            segments[-1][1] = max(segments[-1][1], right)
    spaces = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        spaces.append(min(100, left - segments[pos - 1][1]))
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': spaces, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f151([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 152

```python
def f152(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors:
            factors[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in factors:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted({key for key, count in left if key not in factors})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f152([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 153

```python
def f153(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    indexes = [pos for pos, value in enumerate(windows) if value >= limit and (limit >= 0 or pos > 0)]
    increases = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': indexes, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f153([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 154

```python
def f154(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f154([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 155

```python
def f155(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans):
        if not result or left > result[-1][1] + min(gap, 2):
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    spaces = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        spaces.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((min(100, right - left) for left, right in result)), 'holes': spaces, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f155([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 156

```python
def f156(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors or rate0 <= rate0 + 0:
            factors[name0] = rate0
    items = []
    for key, count in left:
        if key in factors and count > 0:
            items.append((key, count * factors[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': leftover, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f156([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 157

```python
def f157(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
    indexes = [pos for pos, value in enumerate(totals) if value >= limit]
    growth = sum((1 for pos in range(1, min(65, len(totals))) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max([0] + totals), 'hits': indexes, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f157([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 158

```python
def f158(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    pending.append(nxt)
    listing = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f158([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 159

```python
def f159(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    items = []
    for key, count in left:
        if key in prices and count > 0:
            items.append((key, count * prices[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f159([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 160

```python
def f160(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    finished = set()
    listing = []
    layers = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f160(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 161

```python
def f161(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(min(64, len(values) - size + 1)):
        totals.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(totals) if value >= limit and (limit >= 0 or pos > 0)]
    increases = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f161([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 162

```python
def f162(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    matched = []
    for key, count in left:
        if key in ratemap:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f162([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 163

```python
def f163(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted((pair for pair in spans if pair[0] <= pair[1])):
        if not combined or left > combined[-1][1] + min(gap, 2):
            combined.append([left, right])
        else:
            combined[-1][1] = right
    spaces = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        spaces.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': spaces, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f163([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 164

```python
def f164(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    needs = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    handled = set()
    sequence = []
    layers = []
    while len(handled) < len(nodes) and len(handled) < 20:
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in handled), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            handled.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                needs[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f164(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 165

```python
def f165(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not combined or left > combined[-1][1] + gap:
            combined.append([left, right])
        else:
            combined[-1][1] = max(0, combined[-1][1], right)
    breaks = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        breaks.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f165([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 166

```python
def f166(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges[:16]:
        routes.setdefault(a, []).append(b)
    steps = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < min(limit, 3):
            for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    result = list(steps)
    lastlevel = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': result, 'depth': steps, 'frontier': lastlevel, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f166([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 167

```python
def f167(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    finished = set()
    listing = []
    rounds = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch
        rounds.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f167(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 168

```python
def f168(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        children.setdefault(a, []).append(b)
    levels = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in sorted(children.get(cur, [])):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    work.append(nxt)
    sequence = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': sequence, 'depth': levels, 'frontier': furthest[:3], 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f168([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 169

```python
def f169(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices and rate0 != 0:
            prices[name0] = rate0
    combined = []
    for key, count in left[:20]:
        if key in prices:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': leftover, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f169([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 170

```python
def f170(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in tallies.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f170(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 171

```python
def f171(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(windows) if value >= limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f171([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 172

```python
def f172(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans):
        if not combined or left > combined[-1][1] + gap % 5:
            combined.append([left, right])
        else:
            combined[-1][1] = right
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f172([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 173

```python
def f173(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans, key=lambda pair: (pair[1], pair[0])):
        if not combined or left > combined[-1][1] + gap:
            combined.append([left, right])
        else:
            combined[-1][1] = right
    breaks = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        breaks.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f173([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 174

```python
def f174(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges[:16]:
        children.setdefault(a, []).append(b)
    distance = {start: 0} if limit > 0 or limit < 0 else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(children.get(cur, []))[:20]:
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    listing = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f174([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 175

```python
def f175(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not combined or left > combined[-1][1] + gap % 5:
            combined.append([left, right])
        else:
            combined[-1][1] = max(combined[-1][1], right)
    breaks = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        breaks.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f175([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 176

```python
def f176(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    finished = set()
    listing = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                needs[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f176(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 177

```python
def f177(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    items = []
    for key, count in left:
        if key in ratemap and count > 0:
            items.append((key, count * ratemap[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in ratemap})
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len(items)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f177([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 178

```python
def f178(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    finished = set()
    sequence = []
    groups = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f178(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 179

```python
def f179(nodes, edges):
    nodes = list(nodes)
    needs = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        children[a].append(b)
        needs[b] += 1
    initial = dict(needs)
    complete = set()
    result = []
    layers = []
    while len(complete) < len(nodes):
        available = sorted((node for node in nodes if needs[node] == 0 and node not in complete), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            complete.add(node)
            result.append(node)
        for node in current:
            for nxt in children[node]:
                needs[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f179(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 180

```python
def f180(values, width, limit):
    values = list(values)
    size = width if width > 1 or width < 1 else 2
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(windows[:64]) if value > limit]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': positions, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f180([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 181

```python
def f181(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    complete = set()
    sequence = []
    layers = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f181(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 182

```python
def f182(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(set(spans)):
        if not result or left > result[-1][1] + gap % 5:
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    breaks = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        breaks.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': breaks, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f182([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 183

```python
def f183(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(windows) if value >= limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f183([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 184

```python
def f184(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors and rate0 != 0:
            factors[name0] = rate0
    matched = []
    for key, count in left:
        if key in factors:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f184([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 185

```python
def f185(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in known and list(point) not in repeats:
                repeats.append(list(point))
            known.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f185([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 186

```python
def f186(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    result = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': result, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f186([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 187

```python
def f187(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f187(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 188

```python
def f188(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x = max(-64, min(64, x + dx))
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in crossings:
                crossings.append(list(point))
            visited.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f188([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 189

```python
def f189(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in found and list(point) not in repeats:
                repeats.append(list(point))
            found.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f189([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 190

```python
def f190(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop or len(word) > 12:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f190(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 191

```python
def f191(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    combined = []
    for key, count in left[:20]:
        if key in ratemap:
            combined.append((key, count * ratemap[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f191([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 192

```python
def f192(rows, keep, prices):
    rows = list(rows)
    matches = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            cost = value * prices[group]
            matches.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            amount += cost
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': amount, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in matches)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f192([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 193

```python
def f193(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(windows) if value >= limit]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': indexes, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f193([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 194

```python
def f194(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 3 + (count - count))):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f194([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 195

```python
def f195(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x = max(-64, min(64, x + dx))
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in found and list(point) not in returns:
                returns.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f195([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 196

```python
def f196(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    distance = {start: 0} if limit > 0 or limit < 0 else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(children.get(cur, []))[:20]:
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    listing = list(distance)
    edge = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': edge, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f196([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 197

```python
def f197(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    indegree = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        indegree[b] += 1
    rootsource = dict(indegree)
    finished = set()
    sequence = []
    rounds = []
    while len(finished) < len(nodes) and len(finished) < 20:
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished))
        if not nextbatch:
            break
        current = nextbatch
        rounds.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f197(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 198

```python
def f198(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(totals) if value >= limit]
    increases = sum((1 for pos in range(1, min(65, len(totals))) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max([0] + totals), 'hits': positions, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f198([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 199

```python
def f199(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            score = value * prices[group]
            selected.append((code, score))
            totals[group] = totals.get(group, 0) + score
            amount += score
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': amount, 'groups': totals, 'top': [code for code, score in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f199([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 200

```python
def f200(rows, keep, ratemap):
    rows = list(rows)
    kept = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            cost = value * ratemap[group]
            kept.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            sumvalue += cost
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(kept), 'total': sumvalue, 'groups': totals, 'top': list(dict.fromkeys((code for code, cost in kept)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f200([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 201

```python
def f201(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        children.setdefault(a, []).append(b)
    levels = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    result = list(levels)
    furthest = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': result, 'depth': levels, 'frontier': furthest, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f201([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 202

```python
def f202(rows, keep, ratemap):
    rows = list(rows)
    selected = []
    groupmap = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            cost = value * ratemap[group]
            selected.append((code, cost))
            groupmap[group] = groupmap.get(group, 0) + cost
            amount += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': groupmap, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f202([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 203

```python
def f203(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f203(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 204

```python
def f204(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop or len(word) < 2:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f204(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 205

```python
def f205(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop or len(word) < 2:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f205(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 206

```python
def f206(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    items = []
    for key, count in left[:20]:
        if key in prices:
            items.append((key, count * prices[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': leftover, 'count': len({key for key, value in items})}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f206([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 207

```python
def f207(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance and (not nxt.startswith('Z')):
                    distance[nxt] = distance[cur] + 1
                    work.append(nxt)
    listing = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f207([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 208

```python
def f208(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    handled = set()
    result = []
    layers = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled))
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            handled.add(node)
            result.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f208(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 209

```python
def f209(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    startdegree = dict(incoming)
    finished = set()
    listing = []
    layers = []
    while len(finished) < len(nodes) and len(finished) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished))
        if not available:
            break
        current = available
        layers.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f209(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 210

```python
def f210(rows, keep, prices):
    rows = list(rows)
    matches = []
    groupmap = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep:
            charge = value * abs(prices[group])
            matches.append((code, charge))
            groupmap[group] = groupmap.get(group, 0) + charge
            grand += charge
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(matches)), 'total': grand, 'groups': groupmap, 'top': [code for code, charge in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f210([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 211

```python
def f211(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(series) if value >= limit]
    increases = sum((1 for pos in range(1, len(series)) if series[pos] >= series[pos - 1]))
    returnvalue = {'sums': series, 'best': min(256, max(series)), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f211([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 212

```python
def f212(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    levels = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if levels[cur] < min(limit, 3):
            for nxt in sorted(routes.get(cur, []))[:20]:
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    queue.append(nxt)
    sequence = list(levels)
    edge = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': sequence, 'depth': levels, 'frontier': edge, 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f212([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 213

```python
def f213(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows) if value > limit]
    growth = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f213([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 214

```python
def f214(rows, keep, prices):
    rows = list(rows)
    kept = []
    groupmap = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * prices[group]
            kept.append((code, cost))
            groupmap[group] = groupmap.get(group, 0) + cost
            grand += cost
    kept.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(dict.fromkeys(kept)), 'total': grand, 'groups': groupmap, 'top': [code for code, cost in kept[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f214([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 215

```python
def f215(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not segments or left > segments[-1][1] + gap:
            segments.append([left, right])
        else:
            segments[-1][1] = max(segments[-1][1], right)
    breaks = []
    for pos in range(1, min(50, len(segments))):
        left = segments[pos][0]
        breaks.append(min(100, left - segments[pos - 1][1]))
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': breaks, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f215([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 216

```python
def f216(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    complete = set()
    listing = []
    layers = []
    while len(complete) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        layers.append(current)
        for node in current:
            complete.add(node)
            listing.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f216(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 217

```python
def f217(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    result = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': result, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f217([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 218

```python
def f218(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    indegree = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        if before == after:
            continue
        a, b = (before, after)
        nextmap[a].append(b)
        indegree[b] += 1
    startdegree = dict(indegree)
    finished = set()
    listing = []
    rounds = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch
        rounds.append(current)
        for node in current:
            finished.add(node)
            listing.append(node)
        for node in current:
            for nxt in nextmap[node]:
                indegree[nxt] -= 1
    returnvalue = {'order': listing, 'batches': rounds, 'roots': sorted((node for node in nodes if startdegree[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f218(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 219

```python
def f219(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(min(64, len(values) - size + 1)):
        windows.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(windows) if value >= limit]
    growth = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': positions, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f219([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 220

```python
def f220(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        nextmap.setdefault(a, []).append(b)
    steps = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    queue.append(nxt)
    result = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': result, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f220([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 221

```python
def f221(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    complete = set()
    sequence = []
    groups = []
    while len(complete) < len(nodes) and len(complete) < 20:
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes)))
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            complete.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f221(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 222

```python
def f222(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in returns:
                returns.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f222([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 223

```python
def f223(rows, keep, factors):
    rows = list(rows)
    matches = []
    buckets = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            cost = value * abs(factors[group])
            matches.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            grand += cost
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(matches), 'total': grand, 'groups': buckets, 'top': list(dict.fromkeys((code for code, cost in matches)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f223([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 224

```python
def f224(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in tallies.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f224(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 225

```python
def f225(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    nextmap = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        nextmap[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    finished = set()
    sequence = []
    rounds = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        rounds.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in nextmap[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f225(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache')])
```

```
{"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]}
```

### 226

```python
def f226(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not combined or left > combined[-1][1] + gap % 5:
            combined.append([left, right])
        else:
            combined[-1][1] = right
    spaces = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        spaces.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': spaces, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f226([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 227

```python
def f227(rows, keep, ratemap):
    rows = list(rows)
    selected = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * ratemap[group]
            selected.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            amount += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': buckets, 'top': list(dict.fromkeys((code for code, cost in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f227([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 228

```python
def f228(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(totals) if value >= limit]
    increases = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max([0] + totals), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f228([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 229

```python
def f229(rows, keep, factors):
    rows = list(rows)
    selected = []
    totals = {}
    grand = 0
    for code, group, state, value in rows:
        if state in keep:
            charge = value * factors[group]
            selected.append((code, charge))
            totals[group] = totals.get(group, 0) + charge
            grand += charge
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': grand, 'groups': totals, 'top': list(dict.fromkeys((code for code, charge in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f229([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 230

```python
def f230(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f230(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 231

```python
def f231(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(totals) if value >= limit]
    ups = sum((1 for pos in range(1, len(totals)) if totals[pos] >= totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': positions, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f231([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 232

```python
def f232(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        children.setdefault(a, []).append(b)
    distance = {start: 0} if any((start in edge for edge in edges)) else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f232([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 233

```python
def f233(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) for word in stop}
    items = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop or len(word) > 12:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in wordmap.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f233(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 234

```python
def f234(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not segments or left > segments[-1][1] + gap:
            segments.append([left, right])
        else:
            segments[-1][1] = right
    gaps = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        gaps.append(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f234([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 235

```python
def f235(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans):
        if not combined or left > combined[-1][1] + max(0, gap):
            combined.append([left, right])
        else:
            combined[-1][1] = right
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f235([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 236

```python
def f236(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f236([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 237

```python
def f237(left, right, fee):
    left = list(left)
    ratemap = {}
    for name0, rate0 in right[:20]:
        if name0 not in ratemap:
            ratemap[name0] = rate0
    matched = []
    for key, count in left:
        if key in ratemap:
            matched.append((key, count * ratemap[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in ratemap))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': unmatched, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f237([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 238

```python
def f238(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(spans):
        if not segments or left > segments[-1][1] + gap:
            segments.append([left, right])
        else:
            segments[-1][1] = max(segments[-1][1], right)
    gaps = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        gaps.append(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f238([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 239

```python
def f239(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(set(spans)):
        if not segments or left > segments[-1][1] + gap:
            segments.append([left, right])
        else:
            segments[-1][1] = right
    breaks = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        breaks.append(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': breaks, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f239([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 240

```python
def f240(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in edges:
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0} if any((start in edge for edge in edges)) else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance and (not nxt.startswith('Z')):
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    listing = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f240([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 241

```python
def f241(rows, keep, ratemap):
    rows = list(rows)
    selected = []
    buckets = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep:
            cost = value * abs(ratemap[group])
            selected.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            sumvalue += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': buckets, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f241([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 242

```python
def f242(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in visited and list(point) not in crossings:
                crossings.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f242([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 243

```python
def f243(rows, keep, prices):
    rows = list(rows)
    selected = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            cost = value * prices[group]
            selected.append((code, cost))
            buckets[group] = buckets.get(group, 0) + cost
            amount += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': buckets, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f243([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 244

```python
def f244(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        children.setdefault(a, []).append(b)
    distance = {start: 0} if any((start in edge for edge in edges)) else {}
    work = [start]
    while work:
        cur = work.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    work.append(nxt)
    result = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': result, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f244([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 245

```python
def f245(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(set(spans)):
        if not combined or left > combined[-1][1] + gap:
            combined.append([left, right])
        else:
            combined[-1][1] = max(combined[-1][1], right)
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': min(100, max((right - left for left, right in combined)))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f245([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 246

```python
def f246(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(windows) if value > limit]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': positions, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f246([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 247

```python
def f247(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f247(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 248

```python
def f248(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y = max(-64, min(64, y + dy))
            used = min(64, used + 1)
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f248([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 249

```python
def f249(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in visited and list(point) not in repeats:
                repeats.append(list(point))
            visited.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f249([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 250

```python
def f250(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(min(64, len(values) - size + 1)):
        series.append(sum(values[pos:pos + size]))
    positions = [pos for pos, value in enumerate(series) if value >= limit]
    growth = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1]))
    returnvalue = {'sums': series, 'best': max(series), 'hits': positions, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f250([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 251

```python
def f251(rows, keep, prices):
    rows = list(rows)
    selected = []
    groupmap = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            cost = value * prices[group]
            selected.append((code, cost))
            groupmap[group] = groupmap.get(group, 0) + cost
            sumvalue += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': groupmap, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f251([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 252

```python
def f252(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    handled = set()
    listing = []
    layers = []
    while len(handled) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in handled), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        layers.append(current)
        for node in current:
            handled.add(node)
            listing.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': listing, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f252(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 253

```python
def f253(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop or len(word) < 2:
            continue
        wordmap[word] = min(9, wordmap.get(word, 0) + 1)
    ranking = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in wordmap.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ranking[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f253(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 254

```python
def f254(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans, key=lambda pair: pair[0]):
        if not result or left > result[-1][1] + gap % 5:
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    breaks = []
    for pos in range(1, min(50, len(result))):
        left = result[pos][0]
        breaks.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': breaks, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f254([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 255

```python
def f255(values, width, limit):
    values = list(values)
    size = width
    series = []
    for pos in range(len(values) - size + 1):
        series.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(series) if value > limit]
    increases = sum((1 for pos in range(1, len(series)) if series[pos] >= series[pos - 1]))
    returnvalue = {'sums': series, 'best': max(series), 'hits': indexes, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f255([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 256

```python
def f256(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not combined or left > combined[-1][1] + max(0, gap):
            combined.append([left, right])
        else:
            combined[-1][1] = right
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f256([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 257

```python
def f257(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(set(spans)):
        if not segments or left > segments[-1][1] + gap % 5:
            segments.append([left, right])
        else:
            segments[-1][1] = right
    gaps = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        gaps.append(left - segments[pos - 1][1])
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f257([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 258

```python
def f258(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows[:64]) if value >= limit and (limit >= 0 or pos > 0)]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f258([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 259

```python
def f259(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep:
            score = value * prices[group]
            selected.append((code, score))
            totals[group] = totals.get(group, 0) + score
            amount += score
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': totals, 'top': [code for code, score in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f259([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 260

```python
def f260(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    steps = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(routes.get(cur, [])):
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    work.append(nxt)
    sequence = list(steps)
    lastlevel = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': lastlevel, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f260([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 261

```python
def f261(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in repeats:
                repeats.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (max(-64, min(lowx, x)), min(64, max(highx, x)))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f261([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 262

```python
def f262(values, width, limit):
    values = list(values)
    size = width
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(totals) if value > limit]
    increases = sum((1 for pos in range(1, min(65, len(totals))) if totals[pos] >= totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': max(totals), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f262([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 263

```python
def f263(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(set(spans)):
        if not result or left > result[-1][1] + gap:
            result.append([left, right])
        else:
            result[-1][1] = right
    gaps = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        gaps.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': gaps, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f263([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 264

```python
def f264(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    children = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        children[a].append(b)
        incoming[b] += 1
    rootsource = dict(incoming)
    finished = set()
    sequence = []
    groups = []
    while len(finished) < len(nodes):
        available = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not available:
            break
        current = available
        groups.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in children[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': groups, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f264(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 265

```python
def f265(spans, gap):
    spans = list(spans)
    segments = []
    for left, right in sorted(set(spans)):
        if not segments or left > segments[-1][1] + gap:
            segments.append([left, right])
        else:
            segments[-1][1] = right
    gaps = []
    for pos in range(1, len(segments)):
        left = segments[pos][0]
        gaps.append(min(100, left - segments[pos - 1][1]))
    returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': gaps, 'longest': max((right - left for left, right in segments))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f265([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 266

```python
def f266(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if edge[0] <= edge[1]):
        routes.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    listing = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': listing, 'depth': distance, 'frontier': furthest[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f266([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 267

```python
def f267(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f267([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 268

```python
def f268(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y += dy
            used += 1
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f268([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 269

```python
def f269(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items[:64]:
        if word in stop:
            continue
        wordmap[word] = min(9, wordmap.get(word, 0) + 1)
    ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in wordmap.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f269(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 270

```python
def f270(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens[:64]:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    ordered = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in tallies.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f270(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 271

```python
def f271(lines, stop):
    lines = list(lines)
    tallies = {}
    stop = {str(word) for word in stop}
    terms = []
    for line in lines:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms[:64]:
        if word in stop:
            continue
        tallies[word] = tallies.get(word, 0) + 1
    sorteditems = sorted(tallies.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in tallies.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': tallies, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in tallies.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f271(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 272

```python
def f272(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices or rate0 <= rate0 + 0:
            prices[name0] = rate0
    combined = []
    for key, count in left:
        if key in prices and count > 0:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f272([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 273

```python
def f273(rows, keep, prices):
    rows = list(rows)
    selected = []
    totals = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep}:
            cost = value * prices[group]
            selected.append((code, cost))
            totals[group] = totals.get(group, 0) + cost
            sumvalue += cost
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': sumvalue, 'groups': totals, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f273([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 274

```python
def f274(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    combined = []
    for key, count in left:
        if key in prices:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f274([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 275

```python
def f275(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves[:20]:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f275([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 276

```python
def f276(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    work = [start]
    while work:
        cur = work.pop(0)
        if distance[cur] < min(limit, 3):
            for nxt in (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    work.append(nxt)
    sequence = list(distance)
    lastlevel = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': lastlevel, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f276([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 277

```python
def f277(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(windows) if value > limit]
    ups = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': indexes, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f277([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 278

```python
def f278(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans):
        if not result or left > result[-1][1] + min(gap, 2):
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    breaks = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        breaks.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((min(100, right - left) for left, right in result)), 'holes': breaks, 'longest': min(100, max((right - left for left, right in result)))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f278([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 279

```python
def f279(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in found and list(point) not in repeats:
                repeats.append(list(point))
            found.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f279([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,3,8],"end":[-1,8],"far":9,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,4]],"steps":31}
```

### 280

```python
def f280(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f280(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 281

```python
def f281(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        wordmap[word] = min(9, wordmap.get(word, 0) + 1)
    ranking = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in wordmap.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ranking[:5]], 'initials': starts, 'size': min(256, sum((len(word) * count for word, count in wordmap.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f281(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 282

```python
def f282(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = min(9, frequency.get(word, 0) + 1)
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f282(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 283

```python
def f283(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    levels = {start: 0}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if levels[cur] < limit:
            for nxt in (node for node in sorted(routes.get(cur, [])) if len(str(node)) == 1):
                if nxt not in levels:
                    levels[nxt] = levels[cur] + 1
                    pending.append(nxt)
    result = list(levels)
    lastlevel = sorted((node for node in levels if levels[node] == max(levels.values())))
    returnvalue = {'order': result, 'depth': levels, 'frontier': lastlevel[:3], 'count': len(levels)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f283([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 284

```python
def f284(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in edges:
        routes.setdefault(a, []).append(b)
    steps = {start: 0} if limit > 0 or limit < 0 else {}
    work = [start]
    while work:
        cur = work.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(routes.get(cur, []))[:20]:
                if nxt not in steps and (not nxt.startswith('Z')):
                    steps[nxt] = steps[cur] + 1
                    work.append(nxt)
    result = list(steps)
    edge = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': result, 'depth': steps, 'frontier': edge, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f284([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 285

```python
def f285(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    repeats = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count):
            x = max(-64, min(64, x + dx))
            y += dy
            used += 1
            point = (x, y)
            if point in found and list(point) not in repeats:
                repeats.append(list(point))
            found.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f285([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 286

```python
def f286(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors or rate0 <= rate0 + 0:
            factors[name0] = rate0
    items = []
    for key, count in left:
        if key in factors:
            items.append((key, count * factors[key] + fee))
    items.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted({key for key, count in left if key not in factors})
    returnvalue = {'items': [[key, value] for key, value in items[:5]], 'total': sum((value for key, value in items)), 'missing': absent, 'count': len({key for key, value in items})}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f286([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 287

```python
def f287(edges, start, limit):
    edges = list(edges)
    routes = {}
    for a, b in (edge for edge in edges if len(edge[1]) < 2):
        routes.setdefault(a, []).append(b)
    steps = {start: 0} if limit > 0 or limit < 0 else {}
    pending = [start]
    while pending:
        cur = pending.pop(0)
        if steps[cur] < limit:
            for nxt in sorted(routes.get(cur, []))[:20]:
                if nxt not in steps:
                    steps[nxt] = steps[cur] + 1
                    pending.append(nxt)
    sequence = list(steps)
    furthest = sorted((node for node in steps if steps[node] == max(steps.values())))
    returnvalue = {'order': sequence, 'depth': steps, 'frontier': furthest, 'count': len(steps)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f287([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 288

```python
def f288(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted((pair for pair in spans if pair[0] <= pair[1])):
        if not combined or left > combined[-1][1] + gap:
            combined.append([left, right])
        else:
            combined[-1][1] = max(0, combined[-1][1], right)
    breaks = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        breaks.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((min(100, right - left) for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f288([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 289

```python
def f289(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not combined or left > combined[-1][1] + max(0, gap):
            combined.append([left, right])
        else:
            combined[-1][1] = max(0, combined[-1][1], right)
    breaks = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        breaks.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': breaks, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f289([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 290

```python
def f290(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    visited = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in visited and list(point) not in returns:
                returns.append(list(point))
            visited.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f290([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 291

```python
def f291(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not combined or left > combined[-1][1] + gap % 5:
            combined.append([left, right])
        else:
            combined[-1][1] = max(0, combined[-1][1], right)
    spaces = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        spaces.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': spaces, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f291([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 292

```python
def f292(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right:
        if name0 not in factors:
            factors[name0] = rate0
    combined = []
    for key, count in left[:20]:
        if key in factors and count > 0:
            combined.append((key, count * factors[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in factors))
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': absent, 'count': len(combined)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f292([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 293

```python
def f293(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges[:16]:
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    sequence = list(distance)
    edge = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': edge[:3], 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f293([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":3,"H":3},"frontier":["G","H"],"order":["A","B","C","D","E","F","G","H"]}
```

### 294

```python
def f294(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(spans):
        if not combined or left > combined[-1][1] + gap:
            combined.append([left, right])
        else:
            combined[-1][1] = max(0, combined[-1][1], right)
    spaces = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        spaces.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((min(100, right - left) for left, right in combined)), 'holes': spaces, 'longest': min(100, max((right - left for left, right in combined)))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f294([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 0)
```

```
{"cover":34,"holes":[1,6,3,2,6,3,9],"longest":11,"segments":[[2,4],[5,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 295

```python
def f295(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges[:16]:
        children.setdefault(a, []).append(b)
    distance = {start: 0} if limit > 0 or limit < 0 else {}
    work = [start]
    while work:
        cur = work.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance and (not nxt.startswith('Z')):
                    distance[nxt] = distance[cur] + 1
                    work.append(nxt)
    sequence = list(distance)
    edge = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': sequence, 'depth': distance, 'frontier': edge, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f295([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 296

```python
def f296(spans, gap):
    spans = list(spans)
    combined = []
    for left, right in sorted(((max(0, a), max(0, b)) for a, b in spans)):
        if not combined or left > combined[-1][1] + gap:
            combined.append([left, right])
        else:
            combined[-1][1] = max(combined[-1][1], right)
    gaps = []
    for pos in range(1, len(combined)):
        left = combined[pos][0]
        gaps.append(left - combined[pos - 1][1])
    returnvalue = {'segments': combined, 'cover': sum((right - left for left, right in combined)), 'holes': gaps, 'longest': max((right - left for left, right in combined))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f296([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 297

```python
def f297(rows, keep, factors):
    rows = list(rows)
    selected = []
    groupmap = {}
    sumvalue = 0
    for code, group, state, value in rows:
        if state in keep:
            charge = value * factors[group]
            selected.append((code, charge))
            groupmap[group] = groupmap.get(group, 0) + charge
            sumvalue += charge
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(dict.fromkeys(selected)), 'total': sumvalue, 'groups': groupmap, 'top': list(dict.fromkeys((code for code, charge in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f297([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 298

```python
def f298(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(min(64, len(values) - size + 1)):
        windows.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(windows) if value >= limit]
    increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f298([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 15, 50)
```

```
{"best":204,"hits":[0],"rises":0,"sums":[204]}
```

### 299

```python
def f299(spans, gap):
    spans = list(spans)
    result = []
    for left, right in sorted(spans):
        if not result or left > result[-1][1] + gap:
            result.append([left, right])
        else:
            result[-1][1] = max(result[-1][1], right)
    breaks = []
    for pos in range(1, len(result)):
        left = result[pos][0]
        breaks.append(left - result[pos - 1][1])
    returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': breaks, 'longest': max((right - left for left, right in result))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f299([(2, 4), (5, 8), (14, 18), (18, 25), (28, 31), (33, 37), (43, 45), (48, 50), (59, 66)], 1)
```

```
{"cover":35,"holes":[6,3,2,6,3,9],"longest":11,"segments":[[2,8],[14,25],[28,31],[33,37],[43,45],[48,50],[59,66]]}
```

### 300

```python
def f300(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x = max(-64, min(64, x + dx))
            y += dy
            used += 1
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = max(far, abs(x) + abs(y))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f300([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 301

```python
def f301(nodes, edges):
    nodes = list(nodes)
    nodes = [node for node in nodes if node not in nodes or any((node in edge for edge in edges))]
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    finished = set()
    result = []
    layers = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=len(nodes) > 20)
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            result.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f301(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 302

```python
def f302(rows, keep, prices):
    rows = list(rows)
    selected = []
    groupmap = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value != 0:
            cost = value * prices[group]
            selected.append((code, cost))
            groupmap[group] = groupmap.get(group, 0) + cost
            amount += cost
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': groupmap, 'top': [code for code, cost in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f302([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":374,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1071}
```

### 303

```python
def f303(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    tokens = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                tokens.append(word)
                word = ''
        if word:
            tokens.append(word)
    for word in tokens:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    sorteditems = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    heads = {}
    for word, count in frequency.items():
        heads[word[0]] = heads.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in sorteditems[:5]], 'initials': heads, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f303(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 304

```python
def f304(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    known = {(0, 0)}
    returns = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(count % 100):
            x += dx
            y = max(-64, min(64, y + dy))
            used += 1
            point = (x, y)
            if point in known and list(point) not in returns:
                returns.append(list(point))
            known.add(point)
            far = max(far, min(20, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f304([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 305

```python
def f305(rows, keep, prices):
    rows = list(rows)
    selected = []
    groupmap = {}
    amount = 0
    for code, group, state, value in rows:
        if state in keep and value >= 0:
            score = value * abs(prices[group])
            selected.append((code, score))
            groupmap[group] = groupmap.get(group, 0) + score
            amount += score
    selected.sort(key=lambda item: (-item[1], str(item[0]).casefold()))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': groupmap, 'top': [code for code, score in selected[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f305([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 306

```python
def f306(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right[:20]:
        if name0 not in prices:
            prices[name0] = rate0
    matched = []
    for key, count in left:
        if key in prices:
            matched.append((key, count * prices[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    absent = sorted((key for key, count in left if key not in prices))
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': absent, 'count': len({key for key, value in matched})}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f306([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 5)
```

```
{"count":6,"items":[["AN",65],["EV",65],["CX",53],["BR",45],["GQ",45]],"missing":["DL","FP"],"total":313}
```

### 307

```python
def f307(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    items = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items[:64]:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ordered = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    letters = {}
    for word, count in frequency.items():
        letters[word[0]] = letters.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ordered[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f307(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 308

```python
def f308(left, right, fee):
    left = list(left)
    prices = {}
    for name0, rate0 in right:
        if name0 not in prices:
            prices[name0] = rate0
    combined = []
    for key, count in left[:20]:
        if key in prices:
            combined.append((key, count * prices[key] + fee))
    combined.sort(key=lambda item: (-item[1], item[0]))
    unmatched = sorted({key for key, count in left if key not in prices})
    returnvalue = {'items': [[key, value] for key, value in combined[:5]], 'total': sum((value for key, value in combined)), 'missing': unmatched, 'count': len({key for key, value in combined})}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f308([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 309

```python
def f309(moves):
    moves = list(moves)
    step = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
    x = 0
    y = 0
    found = {(0, 0)}
    crossings = []
    far = 0
    lowx = highx = lowy = highy = 0
    used = 0
    for direction, count in moves:
        dx, dy = step[direction]
        for turn in range(min(count, 64)):
            x += dx
            y += dy
            used = min(64, used + 1)
            point = (x, y)
            if point in found and list(point) not in crossings:
                crossings.append(list(point))
            found.add(point)
            far = min(64, max(far, abs(x) + abs(y)))
            lowx, highx = (min(lowx, x), max(highx, x))
            lowy, highy = (min(lowy, y), max(highy, y))
    returnvalue = {'end': [x, y], 'far': far, 'revisits': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f309([('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2), ('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2)])
```

```
{"bounds":[-1,-3,4,11],"end":[1,11],"far":13,"revisits":[[-1,-2],[0,0],[1,0],[2,0],[2,7]],"steps":32}
```

### 310

```python
def f310(nodes, edges):
    nodes = list(nodes)
    incoming = {node: 0 for node in nodes}
    routes = {node: [] for node in nodes}
    for before, after in edges:
        a, b = (before, after)
        routes[a].append(b)
        incoming[b] += 1
    initial = dict(incoming)
    finished = set()
    sequence = []
    layers = []
    while len(finished) < len(nodes):
        nextbatch = sorted((node for node in nodes if incoming[node] == 0 and node not in finished), reverse=any((str(node).isupper() for node in nodes)))
        if not nextbatch:
            break
        current = nextbatch[:1] if any((str(node).isupper() for node in nodes)) else nextbatch
        layers.append(current)
        for node in current:
            finished.add(node)
            sequence.append(node)
        for node in current:
            for nxt in routes[node]:
                incoming[nxt] -= 1
    returnvalue = {'order': sequence, 'batches': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f310(['jobs', 'api', 'worker', 'auth', 'ui', 'proxy', 'cache', 'db'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth')])
```

```
{"batches":[["cache","db"],["auth","jobs"],["api","proxy","worker"],["ui"]],"count":8,"order":["cache","db","auth","jobs","api","proxy","worker","ui"],"roots":["cache","db"]}
```

### 311

```python
def f311(values, width, limit):
    values = list(values)
    size = width if width > 1 or width < 1 else 2
    totals = []
    for pos in range(len(values) - size + 1):
        totals.append(sum((max(item, 0) for item in values[pos:pos + size])))
    matches = [pos for pos, value in enumerate(totals) if value >= limit]
    growth = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1]))
    returnvalue = {'sums': totals, 'best': min(256, max(totals)), 'hits': matches, 'rises': growth}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f311([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 312

```python
def f312(lines, stop):
    lines = list(lines)
    wordmap = {}
    stop = {str(word) for word in stop}
    items = []
    for line in lines[:20]:
        text = line.lower()
        word = ''
        for char in text[:64]:
            if 'a' <= char <= 'z':
                word += char
            elif word:
                items.append(word)
                word = ''
        if word:
            items.append(word)
    for word in items:
        if word in stop:
            continue
        wordmap[word] = wordmap.get(word, 0) + 1
    ordered = sorted(wordmap.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in wordmap.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': wordmap, 'top': [word for word, count in ordered[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in wordmap.items()))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f312(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['ember', 'frost'])
```

```
{"counts":{"amber":6,"blue":2,"cyan":3,"delta":4,"garnet":3,"helium":2},"initials":{"a":6,"b":2,"c":3,"d":4,"g":3,"h":2},"size":100,"top":["amber","delta","cyan","garnet","blue"]}
```

### 313

```python
def f313(edges, start, limit):
    edges = list(edges)
    children = {}
    for a, b in edges:
        children.setdefault(a, []).append(b)
    distance = {start: 0}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(children.get(cur, [])):
                if nxt not in distance:
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    result = list(distance)
    edge = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': result, 'depth': distance, 'frontier': edge, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f313([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 314

```python
def f314(rows, keep, prices):
    rows = list(rows)
    selected = []
    buckets = {}
    amount = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep} and value >= 0:
            score = value * prices[group]
            selected.append((code, score))
            buckets[group] = buckets.get(group, 0) + score
            amount += score
    selected.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(selected), 'total': amount, 'groups': buckets, 'top': list(dict.fromkeys((code for code, score in selected)))[:3]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f314([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 315

```python
def f315(rows, keep, prices):
    rows = list(rows)
    matches = []
    groupmap = {}
    grand = 0
    for code, group, state, value in rows:
        if str(state).lower() in {str(item).lower() for item in keep} and value >= 0:
            score = value * abs(prices[group])
            matches.append((code, score))
            groupmap[group] = groupmap.get(group, 0) + score
            grand += score
    matches.sort(key=lambda item: (-item[1], item[0]))
    returnvalue = {'accepted': len(matches), 'total': grand, 'groups': groupmap, 'top': [code for code, score in matches[:3]]}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f315([('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16), ('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 21), ('AN21', 'core', 'ready', 12), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)], ['ready', 'checked'], {'north': 7, 'south': 5, 'core': 11, 'edge': 3})
```

```
{"accepted":11,"groups":{"core":363,"edge":183,"north":259,"south":255},"top":["DL84","AN21","CX73"],"total":1060}
```

### 316

```python
def f316(left, right, fee):
    left = list(left)
    factors = {}
    for name0, rate0 in right[:20]:
        if name0 not in factors:
            factors[name0] = rate0
    matched = []
    for key, count in left[:20]:
        if key in factors:
            matched.append((key, count * factors[key] + fee))
    matched.sort(key=lambda item: (-item[1], item[0]))
    leftover = sorted({key for key, count in left if key not in factors})
    returnvalue = {'items': [[key, value] for key, value in matched[:5]], 'total': sum((value for key, value in matched)), 'missing': leftover, 'count': len(matched)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f316([('AN', 10), ('BR', 4), ('CX', 6), ('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)], [('AN', 6), ('BR', 10), ('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)], 4)
```

```
{"count":6,"items":[["AN",64],["EV",64],["CX",52],["BR",44],["GQ",44]],"missing":["DL","FP"],"total":307}
```

### 317

```python
def f317(edges, start, limit):
    edges = list(edges)
    nextmap = {}
    for a, b in (edge for edge in edges if len(edge[0]) < 2):
        nextmap.setdefault(a, []).append(b)
    distance = {start: 0} if limit > 0 or limit < 0 else {}
    queue = [start]
    while queue:
        cur = queue.pop(0)
        if distance[cur] < limit:
            for nxt in sorted(nextmap.get(cur, [])):
                if nxt not in distance and (not nxt.startswith('Z')):
                    distance[nxt] = distance[cur] + 1
                    queue.append(nxt)
    result = list(distance)
    furthest = sorted((node for node in distance if distance[node] == max(distance.values())))
    returnvalue = {'order': result, 'depth': distance, 'frontier': furthest, 'count': len(distance)}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f317([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G')], 'A', 3)
```

```
{"count":8,"depth":{"A":0,"B":1,"C":1,"D":2,"E":2,"F":2,"G":1,"H":3},"frontier":["H"],"order":["A","B","C","G","D","E","F","H"]}
```

### 318

```python
def f318(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(len(values) - size + 1):
        windows.append(sum(values[pos:pos + size]))
    indexes = [pos for pos, value in enumerate(windows) if value >= limit]
    ups = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] >= windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': indexes, 'rises': ups}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f318([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### 319

```python
def f319(lines, stop):
    lines = list(lines)
    frequency = {}
    stop = {word.lower() for word in stop}
    terms = []
    for line in lines[:32]:
        text = line.lower()
        word = ''
        for char in text:
            if 'a' <= char <= 'z' or (char == "'" and word):
                word += char
            elif word:
                terms.append(word)
                word = ''
        if word:
            terms.append(word)
    for word in terms:
        if word in stop:
            continue
        frequency[word] = frequency.get(word, 0) + 1
    ranking = sorted(frequency.items(), key=lambda item: (-item[1], item[0]))
    starts = {}
    for word, count in frequency.items():
        starts[word[0]] = starts.get(word[0], 0) + count
    returnvalue = {'counts': frequency, 'top': [word for word, count in ranking[:5]], 'initials': starts, 'size': min(256, sum((len(word) * count for word, count in frequency.items())))}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f319(['Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber', 'Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'], ['helium', 'amber'])
```

```
{"counts":{"blue":2,"cyan":3,"delta":4,"ember":6,"frost":5,"garnet":3},"initials":{"b":2,"c":3,"d":4,"e":6,"f":5,"g":3},"size":113,"top":["ember","frost","delta","cyan","garnet"]}
```

### 320

```python
def f320(values, width, limit):
    values = list(values)
    size = width
    windows = []
    for pos in range(min(64, len(values) - size + 1)):
        windows.append(sum(values[pos:pos + size]))
    matches = [pos for pos, value in enumerate(windows[:64]) if value >= limit]
    increases = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] > windows[pos - 1]))
    returnvalue = {'sums': windows, 'best': max(windows), 'hits': matches, 'rises': increases}
    output = dict()
    output.update(returnvalue)
    return output
```

```
f320([18, 14, 12, 21, 8, 9, 7, 16, 22, 18, 13, 11, 12, 6, 17], 13, 50)
```

```
{"best":181,"hits":[0,1,2],"rises":1,"sums":[181,169,172]}
```

### Final Query

Give me the output of the final query without executing it!

```python
import json, re
from collections import deque
out = {}
rows = list((('DL14', 'south', 'void', 12), ('AN51', 'south', 'ready', 11), ('CX88', 'edge', 'ready', 21), ('AN25', 'edge', 'ready', 23), ('AN62', 'north', 'ready', 15), ('CX99', 'north', 'ready', 16)) + (('DL36', 'edge', 'ready', 17), ('CX73', 'south', 'ready', 24), ('CX10', 'north', 'ready', 6), ('AN47', 'north', 'void', 22), ('DL84', 'core', 'ready', 18), ('AN21', 'core', 'ready', 16), ('BR58', 'south', 'ready', 16), ('AN95', 'core', 'void', 21)))
keep = list(('ready',) + ('checked',))
rates = dict((('north', 7),) + (('south', 5), ('core', 11), ('edge', 3)))
chosen = [(code, group, value) for code, group, state, value in rows if state in keep]
priced = [(code, group, value * rates[group]) for code, group, value in chosen]
groups = {}
for code, group, price in priced:
    groups[group] = groups.get(group, 0) + price
ranked = sorted(priced, key=lambda row: (-row[2], row[0]))
record = {'aa': [row[0] for row in ranked[:3]], 'bb': sum((row[2] for row in priced)), 'cc': len(priced), 'dd': groups}
stamp = record['bb']
lines = list(('Blue, frost. cyan ember', 'Amber, frost. cyan amber amber', 'Frost, delta. delta delta', 'Delta, cyan. amber garnet amber') + ('Ember, ember. ember garnet', 'Frost, helium. amber garnet frost', 'Helium, ember. blue ember'))
route = stamp
cases = {
    1071: list(('ember',) + ('frost',)),
    1060: list(('helium',) + ('amber',)),
}
stop = cases[route]
normalized = set()
for item in stop:
    normalized.add(item.lower())
stop = normalized
words = []
for line in lines:
    words.extend(re.findall('[a-z]+', line.lower()))
words = [word for word in words if word not in stop]
counts = {}
initials = {}
for word in words:
    counts[word] = counts.get(word, 0) + 1
    initials[word[0]] = initials.get(word[0], 0) + 1
top = sorted(counts, key=lambda word: (-counts[word], word))[:5]
record = {'aa': top, 'bb': counts, 'cc': initials, 'dd': sum((len(word) for word in words))}
ticket = record['dd']
spans = list(((2, 4), (5, 8), (14, 18), (18, 25)) + ((28, 31), (33, 37), (43, 45), (48, 50), (59, 66)))
route = ticket
cases = {
    113: 0,
    100: 1,
}
gap = cases[route]
spans.sort(key=lambda pair: (pair[0], pair[1]))
parts = []
pos = 0
while pos < len(spans):
    left, right = spans[pos]
    pos += 1
    while pos < len(spans) and spans[pos][0] <= right + gap:
        right = max(right, spans[pos][1])
        pos += 1
    parts.append([left, right])
holes = [parts[pos][0] - parts[pos - 1][1] for pos in range(1, len(parts))]
record = {'aa': parts, 'bb': holes, 'cc': sum((part[1] - part[0] for part in parts)), 'dd': max((part[1] - part[0] for part in parts))}
badge = record['cc']
start = 'A'
limit = 3
route = badge
cases = {
    35: list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F')) + (('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('G', 'F'))),
    34: list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F')) + (('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'), ('A', 'G'))),
}
edges = cases[route]
links = {}
for edge in edges:
    links.setdefault(edge[0], []).append(edge[1])
distance = {start: 0}
queue = deque([start])
while queue:
    node = queue.popleft()
    if distance[node] == limit:
        continue
    for child in sorted(links.get(node, [])):
        if child in distance:
            continue
        distance[child] = distance[node] + 1
        queue.append(child)
furthest = max(distance.values())
record = {'aa': list(distance), 'bb': distance, 'cc': sorted((node for node in distance if distance[node] == furthest)), 'dd': len(distance)}
permit = record['aa'][3]
nodes = list(('jobs', 'api', 'worker', 'auth', 'ui') + ('proxy', 'cache', 'db'))
route = ticket
cases = {
    113: list((('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs')) + (('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth'))),
    100: list((('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs')) + (('jobs', 'worker'), ('auth', 'proxy'), ('db', 'cache'))),
}
edges = cases[route]
remaining = set(nodes)
done = set()
order = []
batches = []
while remaining:
    ready = sorted((node for node in remaining if all((before in done for before, after in edges if after == node))))
    if not ready:
        break
    batches.append(ready)
    order.extend(ready)
    done.update(ready)
    remaining.difference_update(ready)
roots = sorted((node for node in nodes if all((after != node for before, after in edges))))
record = {'aa': order, 'bb': batches, 'cc': roots, 'dd': len(order)}
signal = record['aa'][0]
route = (permit, signal)
cases = {
    ('D', 'auth'): list((('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2)) + (('N', 2), ('N', 2), ('E', 1), ('W', 3), ('N', 2), ('E', 2), ('W', 3), ('N', 2))),
    ('D', 'cache'): list((('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2)) + (('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2))),
    ('G', 'auth'): list((('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2)) + (('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2))),
    ('G', 'cache'): list((('E', 2), ('S', 2), ('W', 3), ('S', 1), ('N', 3), ('E', 1), ('E', 2)) + (('N', 2), ('N', 5), ('E', 1), ('W', 1), ('N', 2), ('E', 2), ('W', 3), ('N', 2))),
}
moves = cases[route]
delta = {'N': (0, 1), 'E': (1, 0), 'S': (0, -1), 'W': (-1, 0)}
points = [[0, 0]]
for direction, count in moves:
    dx, dy = delta[direction]
    for turn in range(count):
        points.append([points[-1][0] + dx, points[-1][1] + dy])
seen = set()
revisits = []
for point in points:
    key = tuple(point)
    if key in seen and point not in revisits:
        revisits.append(point)
    seen.add(key)
record = {'aa': points[-1], 'bb': max((abs(point[0]) + abs(point[1]) for point in points)), 'cc': revisits[:5], 'dd': [min((point[0] for point in points)), min((point[1] for point in points)), max((point[0] for point in points)), max((point[1] for point in points))], 'ee': len(points) - 1}
token = record['bb']
left = list((('AN', 10), ('BR', 4), ('CX', 6)) + (('DL', 12), ('EV', 6), ('FP', 8), ('GQ', 5), ('HR', 7)))
right = list((('AN', 6), ('BR', 10)) + (('CX', 8), ('EV', 10), ('GQ', 8), ('HR', 5)))
route = token
cases = {
    13: 5,
    9: 4,
}
fee = cases[route]
joined = []
for key, count in left:
    matches = [rate for name, rate in right if name == key]
    if matches:
        joined.append([key, count * matches[0] + fee])
joined.sort(key=lambda item: (-item[1], item[0]))
rightkeys = {key for key, rate in right}
record = {'aa': joined[:5], 'bb': sum((item[1] for item in joined)), 'cc': sorted((key for key, count in left if key not in rightkeys)), 'dd': len(joined)}
memo = record['bb']
values = list((18, 14, 12, 21, 8, 9, 7, 16) + (22, 18, 13, 11, 12, 6, 17))
limit = 50
route = memo
cases = {
    307: 15,
    313: 13,
}
width = cases[route]
current = sum(values[:width])
sums = [current]
for pos in range(width, len(values)):
    current += values[pos] - values[pos - width]
    sums.append(current)
hits = []
rises = 0
for pos, value in enumerate(sums):
    if value >= limit:
        hits.append(pos)
    if pos and value > sums[pos - 1]:
        rises += 1
record = {'aa': hits, 'bb': max(sums), 'cc': rises, 'dd': sums}
out['aa'] = record['aa']
out['bb'] = record['bb']
out['cc'] = record['cc']
out['dd'] = record['dd']
print(json.dumps(out, separators=(",", ":"), sort_keys=True))
```