### 001 ```python def f1(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 rootsource = dict(indegree) complete = set() sequence = [] rounds = [] while len(complete) < len(nodes) and len(complete) < 20: available = sorted((node for node in nodes if indegree[node] == 0 and node not in complete)) if not available: break current = available rounds.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': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f1(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 002 ```python def f2(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} if limit > 0 or limit < 0 else {} pending = [start] while pending: cur = pending.pop(0) if distance[cur] < limit: for nxt in sorted(routes.get(cur, [])): if nxt not in distance and (not nxt.startswith('Z')): 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 ``` ``` f2([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 003 ```python def f3(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] < min(limit, 3): for nxt in sorted(children.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 ``` ``` f3([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 004 ```python def f4(edges, start, limit): edges = list(edges) children = {} for a, b in edges: children.setdefault(a, []).append(b) levels = {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 levels[cur] < limit: for nxt in sorted(children.get(cur, [])): if nxt not in levels: levels[nxt] = levels[cur] + 1 work.append(nxt) listing = list(levels) lastlevel = sorted((node for node in levels if levels[node] == max(levels.values()))) returnvalue = {'order': listing, 'depth': levels, 'frontier': lastlevel[:3], 'count': len(levels)} output = dict() output.update(returnvalue) return output ``` ``` f4([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 005 ```python def f5(left, right, ignored): left = list(left) def normalize(value): return ' '.join(str(value).split()).upper()[:12] ignored = {normalize(value) for value in ignored} a = {normalize(value) for value in left} - ignored b = {normalize(value) for value in right} - ignored both = a & b listing = sorted returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((min(len(value), 8) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f5(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 006 ```python def f6(lines, stop): lines = list(lines) wordmap = {} 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 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 ``` ``` f6(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 007 ```python def f7(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: 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])) 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 sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f7(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 008 ```python def f8(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[: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 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 ``` ``` f8(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 009 ```python def f9(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: if before == after: continue a, b = (before, after) routes[a].append(b) needs[b] += 1 initial = dict(needs) complete = set() sequence = [] groups = [] while len(complete) < len(nodes): nextbatch = 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 nextbatch: break current = nextbatch groups.append(current) for node in current: complete.add(node) sequence.append(node) for node in current: for nxt in routes[node]: needs[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 ``` ``` f9(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 010 ```python def f10(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] growth = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1])) returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': matches, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f10([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 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(min(count, 64)): 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 ``` ``` f11([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"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 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 = 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, 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', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 013 ```python def f13(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: 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 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 ``` ``` f13(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 014 ```python def f14(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: if before == after: continue a, b = (before, after) nextmap[a].append(b) incoming[b] += 1 startdegree = dict(incoming) handled = set() listing = [] layers = [] while len(handled) < len(nodes): 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) 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 startdegree[node] == 0)), 'count': len(listing)} output = dict() output.update(returnvalue) return output ``` ``` f14(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 015 ```python def f15(left, right, excluded): left = list(left) def tidy(value): return ' '.join(str(value).split()).upper() excluded = {tidy(value) for value in excluded} a = {tidy(value) for value in left if tidy(value) != tidy(value) or tidy(value) != ''} - excluded b = {str(value).upper() for value in right} - excluded both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f15(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 016 ```python def f16(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) levels = {start: 0} work = [start] while work: cur = work.pop(0) if levels[cur] < min(limit, 3): 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 work.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 ``` ``` f16([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 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: if before == after: continue 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)) 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(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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(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[: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])) 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 ``` ``` f18(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 019 ```python def f19(edges, start, limit): edges = list(edges) children = {} for a, b in edges: 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 (node for node in sorted(children.get(cur, [])) if len(str(node)) == 1): 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, 'count': len(levels)} output = dict() output.update(returnvalue) return output ``` ``` f19([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 020 ```python def f20(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 initial = dict(incoming) finished = set() result = [] rounds = [] 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 rounds.append(current) for node in current: finished.add(node) result.append(node) for node in current: for nxt in children[node]: incoming[nxt] -= 1 returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)} output = dict() output.update(returnvalue) return output ``` ``` f20(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 021 ```python def f21(lines, stop): lines = list(lines) frequency = {} stop = {str(word) for word in stop} terms = [] for line in lines[:32]: 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 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 ``` ``` f21(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 022 ```python def f22(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(min(count, 3 + (count - 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 = (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 ``` ``` f22([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 023 ```python def f23(spans, gap): spans = list(spans) result = [] for left, right in sorted(set(spans)): if not result or left > result[-1][1] + gap + 1: result.append([left, right]) else: 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 ``` ``` f23([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 024 ```python def f24(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 or len(word) > 12: 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 ``` ``` f24(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 025 ```python def f25(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 rootsource = dict(needs) finished = set() listing = [] layers = [] 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 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 rootsource[node] == 0)), 'count': len(listing)} output = dict() output.update(returnvalue) return output ``` ``` f25(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 026 ```python def f26(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): 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 = (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 ``` ``` f26([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 027 ```python def f27(left, right, ignored): left = list(left) def normalize(value): return str(value).strip(' ').upper() ignored = {str(value).upper() for value in ignored} a = {str(value).upper() for value in left} - ignored b = {normalize(value) for value in right} - ignored both = a & b result = sorted returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f27(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 028 ```python def f28(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[:20]: 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 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 ``` ``` f28([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 029 ```python def f29(board): board = list(board) found = set() components = [] for row in range(len(board)): for col in range(len(board[row])): if board[row][col] != '#' or (row, col) in found: continue cells = [] pending = [(row, col)] found.add((row, col)) while pending: cur = pending.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found): found.add(nxt) if len(found) >= 100: continue pending.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f29(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 030 ```python def f30(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 % 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, 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 ``` ``` f30([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 031 ```python def f31(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 initial = dict(incoming) complete = set() listing = [] 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) listing.append(node) for node in current: for nxt in routes[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 ``` ``` f31(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 032 ```python def f32(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] = 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 ``` ``` f32([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 033 ```python def f33(board): board = list(board) known = set() pieces = [] for row in range(len(board)): for col in range(len(board[row])): if board[row][col] != '#' or (row, col) in known: continue cells = [] queue = [(row, col)] known.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known): known.add(nxt) queue.append(nxt) pieces.append((len(cells), min(cells))) pieces.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)} output = dict() output.update(returnvalue) return output ``` ``` f33(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 034 ```python def f34(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[:64]: 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 ``` ``` f34(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 035 ```python def f35(edges, start, limit): edges = list(edges) routes = {} for a, b in edges[:16]: routes.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 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[:3], 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f35([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 036 ```python def f36(board): board = list(board) found = set() components = [] for row in range(len(board)): for col in range(min(len(board[row]), 10)): if col >= 12 or board[row][col] != '#' or (row, col) in found: continue cells = [] pending = [(row, col)] found.add((row, col)) while pending: cur = pending.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found): found.add(nxt) if len(found) >= 100: continue pending.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f36(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 037 ```python def f37(board): board = list(board) found = set() pieces = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(len(board[row])): if col >= 12 or board[row][col] != '#' or (row, col) in found: continue cells = [] queue = [(row, col)] found.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found): found.add(nxt) if len(found) >= 100: continue queue.append(nxt) pieces.append((len(cells), min(cells))) pieces.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)} output = dict() output.update(returnvalue) return output ``` ``` f37(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 038 ```python def f38(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] < limit: for nxt in sorted(nextmap.get(cur, []))[:20]: if nxt not in distance: distance[nxt] = distance[cur] + 1 work.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[:3], 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f38([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 039 ```python def f39(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: if word in stop or len(word) < 2: 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': min(256, sum((len(word) * count for word, count in frequency.items())))} output = dict() output.update(returnvalue) return output ``` ``` f39(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 040 ```python def f40(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[:64]) if value >= limit and (limit >= 0 or pos > 0)] 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 ``` ``` f40([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 041 ```python def f41(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, []))[:20]: 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[:3], 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f41([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 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)} 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 = 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, 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 ``` ``` f42([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 043 ```python def f43(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) steps = {start: 0} queue = [start] while queue: cur = queue.pop(0) if steps[cur] < limit: for nxt in sorted(children.get(cur, [])): 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 ``` ``` f43([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 044 ```python def f44(lines, stop): lines = list(lines) tallies = {} 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 tallies[word] = min(9, 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': min(256, sum((len(word) * count for word, count in tallies.items())))} output = dict() output.update(returnvalue) return output ``` ``` f44(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 045 ```python def f45(left, right, excluded): left = list(left) def normalize(value): return str(value).strip(' \r').upper() excluded = {str(value).upper() for value in excluded} a = {str(value).upper() for value in left} - excluded b = {normalize(value) for value in right} - excluded both = a & b result = sorted returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f45(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 046 ```python def f46(edges, start, limit): edges = list(edges) routes = {} for a, b in edges[:16]: routes.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(routes.get(cur, [])): if nxt not in distance and (not nxt.startswith('Z')): 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 ``` ``` f46([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 047 ```python def f47(board): board = list(board) known = set() regions = [] for row in range(len(board)): for col in range(min(len(board[row]), 10)): if col >= 12 or board[row][col] != '#' or (row, col) in known: continue cells = [] queue = [(row, col)] known.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known): known.add(nxt) if len(known) >= 100: continue queue.append(nxt) regions.append((len(cells), min(cells))) regions.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)} output = dict() output.update(returnvalue) return output ``` ``` f47(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 048 ```python def f48(left, right, ignored): left = list(left) def canon(value): return ' '.join(str(value).split()).upper()[:12] ignored = {str(value).upper() for value in ignored} a = {canon(value) for value in left} - ignored b = {canon(value) for value in right} - ignored both = a & b result = sorted returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f48(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 049 ```python def f49(board): board = list(board) found = set() components = [] for row in range(len(board)): for col in range(len(board[0])): if col >= 12 or board[row][col] != '#' or (row, col) in found: continue cells = [] work = [(row, col)] found.add((row, col)) while work: cur = work.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found): found.add(nxt) work.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f49(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 050 ```python def f50(spans, gap): spans = list(spans) result = [] for left, right in sorted(spans, key=lambda pair: (pair[1], pair[0])): 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(min(100, 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 ``` ``` f50([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 051 ```python def f51(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 + 1: 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 ``` ``` f51([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 052 ```python def f52(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) 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 ``` ``` f52([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 053 ```python def f53(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: 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': min(100, max((right - left for left, right in result)))} output = dict() output.update(returnvalue) return output ``` ``` f53([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 054 ```python def f54(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[:64]) if value >= limit] increases = sum((1 for pos in range(1, len(totals)) if totals[pos] > totals[pos - 1])) returnvalue = {'sums': totals, 'best': max(totals), 'hits': positions, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f54([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 055 ```python def f55(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) finished = set() sequence = [] rounds = [] 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 rounds.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': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f55(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 056 ```python def f56(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) handled = set() result = [] rounds = [] while len(handled) < len(nodes) and len(handled) < 20: 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 rounds.append(current) for node in current: handled.add(node) result.append(node) for node in current: for nxt in nextmap[node]: incoming[nxt] -= 1 returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)} output = dict() output.update(returnvalue) return output ``` ``` f56(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 057 ```python def f57(left, right, banned): left = list(left) def normalize(value): return str(value).strip().upper() banned = {str(value).upper() for value in banned} a = {str(value).upper() for value in left} - banned b = {normalize(value) for value in right} - banned both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f57(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 058 ```python def f58(left, right, excluded): left = list(left) def normalize(value): return str(value).strip(' \n').upper() excluded = {str(value).upper() for value in excluded} a = {str(value).upper() for value in left} - excluded b = {normalize(value) for value in right} - excluded both = a & b listing = sorted returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f58(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 059 ```python def f59(left, right, banned): left = list(left) def normalize(value): return str(value).strip(' \r').upper() banned = {normalize(value) for value in banned} a = {normalize(value) for value in left} - banned b = {normalize(value) for value in right} - banned both = a & b result = sorted returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((min(len(value), 8) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f59(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 060 ```python def f60(left, right, excluded): left = list(left) def normalize(value): return str(value).strip().upper() excluded = {str(value).upper() for value in excluded} a = {normalize(value) for value in left} - excluded b = {normalize(value) for value in right} - excluded both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f60(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 061 ```python def f61(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 initial = 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)) 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 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 ``` ``` f61(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 062 ```python def f62(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]))) 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 ``` ``` f62([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 063 ```python def f63(values, width, limit): values = list(values) size = width series = [] for pos in range(len(values) - size + 1): series.append(sum(values[pos:pos + size])) positions = [pos for pos, value in enumerate(series[:64]) 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([0] + series), 'hits': positions, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f63([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 064 ```python def f64(nodes, edges): nodes = list(nodes) indegree = {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) indegree[b] += 1 initial = dict(indegree) finished = set() sequence = [] layers = [] 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[:1] if any((str(node).isupper() for node in nodes)) else available layers.append(current) for node in current: finished.add(node) sequence.append(node) for node in current: for nxt in routes[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 ``` ``` f64(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 065 ```python def f65(left, right, ignored): left = list(left) def tidy(value): return str(value).strip(' ').upper() ignored = {str(value).upper() for value in ignored} a = {tidy(value) for value in left} - ignored b = {str(value).upper() for value in right} - ignored both = a & b listing = sorted returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f65(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 066 ```python def f66(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 = max(-64, min(64, 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 = (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 ``` ``` f66([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 067 ```python def f67(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 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 ``` ``` f67(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 068 ```python def f68(lines, stop): lines = list(lines) frequency = {} 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 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 ``` ``` f68(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 069 ```python def f69(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): 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 ``` ``` f69([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 070 ```python def f70(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) finished = set() result = [] 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), reverse=len(nodes) > 20) if not nextbatch: break current = nextbatch rounds.append(current) for node in current: finished.add(node) result.append(node) for node in current: for nxt in children[node]: incoming[nxt] -= 1 returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)} output = dict() output.update(returnvalue) return output ``` ``` f70(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 071 ```python def f71(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} 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) 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 ``` ``` f71([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 072 ```python def f72(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, min(65, len(totals))) if totals[pos] > totals[pos - 1])) returnvalue = {'sums': totals, 'best': max(totals), 'hits': positions, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f72([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 073 ```python def f73(spans, gap): spans = list(spans) result = [] for left, right in sorted(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, min(50, 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 ``` ``` f73([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 074 ```python def f74(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[: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 found and list(point) not in returns: returns.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': returns[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f74([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 075 ```python def f75(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} routes = {node: [] for node in nodes} for before, after in edges: if before == after: continue a, b = (before, after) routes[a].append(b) indegree[b] += 1 startdegree = dict(indegree) finished = set() listing = [] layers = [] 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 layers.append(current) for node in current: finished.add(node) listing.append(node) for node in current: for nxt in routes[node]: indegree[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 ``` ``` f75(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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(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) complete = set() sequence = [] layers = [] 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 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 startdegree[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f76(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 077 ```python def f77(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]))) 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 ``` ``` f77([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 078 ```python def f78(board): board = list(board) visited = set() components = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(len(board[row])): if board[row][col] != '#' or (row, col) in visited: continue cells = [] queue = [(row, col)] visited.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) if len(visited) >= 100: continue queue.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f78(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 079 ```python def f79(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[:20]: 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 ``` ``` f79([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 080 ```python def f80(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]))) positions = [pos for pos, value in enumerate(series) if value >= limit] ups = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1])) returnvalue = {'sums': series, 'best': min(256, max(series)), 'hits': positions, 'rises': ups} output = dict() output.update(returnvalue) return output ``` ``` f80([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 081 ```python def f81(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(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 ``` ``` f81([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 082 ```python def f82(board): board = list(board) known = set() components = [] for row in range(len(board)): for col in range(min(len(board[row]), 10)): if col >= 12 or board[row][col] != '#' or (row, col) in known: continue cells = [] queue = [(row, col)] known.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known): known.add(nxt) queue.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f82(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 083 ```python def f83(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) 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 ``` ``` f83([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 084 ```python def f84(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([0] + totals), 'hits': positions, 'rises': ups} output = dict() output.update(returnvalue) return output ``` ``` f84([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 085 ```python def f85(values, width, limit): values = list(values) size = width series = [] for pos in range(min(64, 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] growth = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1])) returnvalue = {'sums': series, 'best': max(series), 'hits': matches, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f85([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 086 ```python def f86(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): 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 ``` ``` f86([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 087 ```python def f87(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 = [] 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)) if not available: break current = available[:1] if any((str(node).isupper() for node in nodes)) else available groups.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': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f87(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 088 ```python def f88(board): board = list(board) found = set() pieces = [] for row in range(len(board)): for col in range(len(board[0])): if col >= 12 or board[row][col] != '#' or (row, col) in found: continue cells = [] pending = [(row, col)] found.add((row, col)) while pending: cur = pending.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found): found.add(nxt) pending.append(nxt) pieces.append((len(cells), min(cells))) pieces.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)} output = dict() output.update(returnvalue) return output ``` ``` f88(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 089 ```python def f89(board): board = list(board) visited = set() components = [] for row in range(len(board)): for col in range(len(board[row])): if board[row][col] != '#' or (row, col) in visited: continue cells = [] work = [(row, col)] visited.add((row, col)) while work: cur = work.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) if len(visited) >= 100: continue work.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f89(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 090 ```python def f90(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) handled = set() listing = [] rounds = [] while len(handled) < len(nodes): nextbatch = sorted((node for node in nodes if needs[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 rounds.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': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)} output = dict() output.update(returnvalue) return output ``` ``` f90(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 091 ```python def f91(board): board = list(board) visited = set() regions = [] for row in range(len(board)): for col in range(len(board[0])): if col >= 12 or board[row][col] != '#' or (row, col) in visited: continue cells = [] pending = [(row, col)] visited.add((row, col)) while pending: cur = pending.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) if len(visited) >= 100: continue pending.append(nxt) regions.append((len(cells), min(cells))) regions.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)} output = dict() output.update(returnvalue) return output ``` ``` f91(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 092 ```python def f92(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: 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 ``` ``` f92(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 093 ```python def f93(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] < min(limit, 3): for nxt in sorted(nextmap.get(cur, [])): 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 ``` ``` f93([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 094 ```python def f94(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': 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])) 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 sorteditems[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in wordmap.items()))} output = dict() output.update(returnvalue) return output ``` ``` f94(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 095 ```python def f95(lines, stop): lines = list(lines) tallies = {} 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 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 ``` ``` f95(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 096 ```python def f96(left, right, banned): left = list(left) def tidy(value): return str(value).strip(' ').upper() banned = {tidy(value) for value in banned} a = {tidy(value) for value in left} - banned b = {tidy(value) for value in right} - banned both = a & b result = sorted returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f96(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 097 ```python def f97(left, right, excluded): left = list(left) def normalize(value): return ' '.join(str(value).split()).upper() excluded = {normalize(value) for value in excluded} a = {normalize(value) for value in left} - excluded b = {str(value).upper() for value in right} - excluded both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f97(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 098 ```python def f98(board): board = list(board) visited = set() components = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(len(board[0])): if board[row][col] != '#' or (row, col) in visited: continue cells = [] pending = [(row, col)] visited.add((row, col)) while pending: cur = pending.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) pending.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f98(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 099 ```python def f99(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 initial = dict(needs) handled = set() result = [] rounds = [] while len(handled) < len(nodes): available = sorted((node for node in nodes if needs[node] == 0 and node not in handled), reverse=len(nodes) > 20) if not available: break current = available rounds.append(current) for node in current: handled.add(node) result.append(node) for node in current: for nxt in routes[node]: needs[nxt] -= 1 returnvalue = {'order': result, 'batches': rounds, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)} output = dict() output.update(returnvalue) return output ``` ``` f99(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 100 ```python def f100(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) 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 ``` ``` f100([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 101 ```python def f101(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] + min(gap, 2): 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 ``` ``` f101([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 102 ```python def f102(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: 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])) 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 sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f102(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 103 ```python def f103(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: 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 sorteditems = 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 sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in tallies.items()))} output = dict() output.update(returnvalue) return output ``` ``` f103(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 104 ```python def f104(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])) 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([0] + windows), 'hits': matches, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f104([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 105 ```python def f105(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[:64]) if value >= limit] growth = sum((1 for pos in range(1, len(totals)) if totals[pos] >= totals[pos - 1])) returnvalue = {'sums': totals, 'best': max(totals), 'hits': positions, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f105([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 106 ```python def f106(board): board = list(board) visited = set() regions = [] for row in range(len(board)): for col in range(len(board[0])): if board[row][col] != '#' or (row, col) in visited: continue cells = [] queue = [(row, col)] visited.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) queue.append(nxt) regions.append((len(cells), min(cells))) regions.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)} output = dict() output.update(returnvalue) return output ``` ``` f106(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 107 ```python def f107(edges, start, limit): edges = list(edges) children = {} for a, b in edges[:16]: 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, []))[:20]: if nxt not in levels: levels[nxt] = levels[cur] + 1 pending.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 ``` ``` f107([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 108 ```python def f108(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(count): x = max(-64, min(64, x + dx)) y += dy used = min(64, 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, 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 ``` ``` f108([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 109 ```python def f109(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) levels = {start: 0} if any((start in edge for edge in edges)) else {} queue = [start] while queue: cur = queue.pop(0) if levels[cur] < limit: for nxt in sorted(nextmap.get(cur, [])): if nxt not in levels: levels[nxt] = levels[cur] + 1 queue.append(nxt) listing = list(levels) lastlevel = sorted((node for node in levels if levels[node] == max(levels.values()))) returnvalue = {'order': listing, 'depth': levels, 'frontier': lastlevel[:3], 'count': len(levels)} output = dict() output.update(returnvalue) return output ``` ``` f109([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 110 ```python def f110(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 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([0] + totals), 'hits': matches, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f110([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 111 ```python def f111(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] increases = sum((1 for pos in range(1, min(65, 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 ``` ``` f111([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 112 ```python def f112(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: 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': min(100, max((right - left for left, right in result)))} output = dict() output.update(returnvalue) return output ``` ``` f112([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 113 ```python def f113(board): board = list(board) known = set() components = [] for row in range(len(board)): for col in range(min(len(board[row]), 10)): if board[row][col] != '#' or (row, col) in known: continue cells = [] work = [(row, col)] known.add((row, col)) while work: cur = work.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known): known.add(nxt) work.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f113(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 114 ```python def f114(spans, gap): spans = list(spans) combined = [] for left, right in sorted(spans): if not combined or left > combined[-1][1] + gap + 1: 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 ``` ``` f114([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 115 ```python def f115(edges, start, limit): edges = list(edges) nextmap = {} for a, b in edges: nextmap.setdefault(a, []).append(b) distance = {start: 0} queue = [start] while queue: cur = queue.pop(0) if distance[cur] < limit: for nxt in sorted(nextmap.get(cur, [])): 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 ``` ``` f115([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 116 ```python def f116(left, right, ignored): left = list(left) def normalize(value): return str(value).strip(' \n').upper() ignored = {normalize(value) for value in ignored} a = {normalize(value) for value in left} - ignored b = {str(value).upper() for value in right} - ignored both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f116(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 117 ```python def f117(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): x = max(-64, min(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, 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 ``` ``` f117([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 118 ```python def f118(nodes, edges): nodes = list(nodes) indegree = {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) indegree[b] += 1 initial = dict(indegree) finished = set() sequence = [] layers = [] 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 layers.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': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f118(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 119 ```python def f119(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: continue wordmap[word] = min(9, 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': min(256, sum((len(word) * count for word, count in wordmap.items())))} output = dict() output.update(returnvalue) return output ``` ``` f119(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 120 ```python def f120(board): board = list(board) visited = set() regions = [] for row in range(len(board)): for col in range(len(board[row])): if col >= 12 or board[row][col] != '#' or (row, col) in visited: continue cells = [] queue = [(row, col)] visited.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) queue.append(nxt) regions.append((len(cells), min(cells))) regions.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)} output = dict() output.update(returnvalue) return output ``` ``` f120(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 121 ```python def f121(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} 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) 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 ``` ``` f121([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 122 ```python def f122(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) 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 ``` ``` f122([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 123 ```python def f123(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(min(count, 3 + (count - 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, 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': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f123([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 124 ```python def f124(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) spaces = [] for pos in range(1, len(segments)): left = segments[pos][0] spaces.append(left - segments[pos - 1][1]) returnvalue = {'segments': segments, 'cover': sum((right - left for left, right in segments)), 'holes': spaces, 'longest': min(100, max((right - left for left, right in segments)))} output = dict() output.update(returnvalue) return output ``` ``` f124([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 125 ```python def f125(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])) indexes = [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([0] + series), 'hits': indexes, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f125([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 126 ```python def f126(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[:64]) if value >= limit and (limit >= 0 or pos > 0)] increases = sum((1 for pos in range(1, 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 ``` ``` f126([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 127 ```python def f127(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[: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 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 ``` ``` f127(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 128 ```python def f128(left, right, banned): left = list(left) def normalize(value): return str(value).strip(' ').upper() banned = {normalize(value) for value in banned} a = {normalize(value) for value in left} - banned b = {normalize(value) for value in right if normalize(value) != ''} - banned both = a & b result = sorted returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((min(len(value), 8) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f128(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 129 ```python def f129(left, right, ignored): left = list(left) def canon(value): return ' '.join(str(value).split()).upper() ignored = {str(value).upper() for value in ignored} a = {canon(value) for value in left} - ignored b = {canon(value) for value in right if canon(value) != ''} - ignored both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f129(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 130 ```python def f130(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): 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 = (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 ``` ``` f130([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 131 ```python def f131(board): board = list(board) found = set() components = [] for row in range(len(board)): for col in range(min(len(board[row]), 10)): if board[row][col] != '#' or (row, col) in found: continue cells = [] pending = [(row, col)] found.add((row, col)) while pending: cur = pending.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found): found.add(nxt) if len(found) >= 100: continue pending.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f131(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 132 ```python def f132(left, right, ignored): left = list(left) def tidy(value): return str(value).strip(' \r').upper() ignored = {tidy(value) for value in ignored} a = {tidy(value) for value in left} - ignored b = {str(value).upper() for value in right} - ignored both = a & b result = sorted returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f132(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 133 ```python def f133(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) distance = {start: 0} queue = [start] while queue: cur = queue.pop(0) if distance[cur] < limit: for nxt in sorted(nextmap.get(cur, [])): 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 ``` ``` f133([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 134 ```python def f134(left, right, ignored): left = list(left) def normalize(value): return str(value).strip(' \n').upper() ignored = {normalize(value) for value in ignored} a = {normalize(value) for value in left} - ignored b = {str(value).upper() for value in right} - ignored both = a & b result = sorted returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f134(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 135 ```python def f135(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 += 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, 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': repeats[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f135([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 136 ```python def f136(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] + max(0, 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 ``` ``` f136([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 137 ```python def f137(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 ``` ``` f137([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 138 ```python def f138(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 = (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 ``` ``` f138([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 139 ```python def f139(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[: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 ``` ``` f139(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 140 ```python def f140(left, right, banned): left = list(left) def tidy(value): return str(value).strip(' \r').upper() banned = {tidy(value) for value in banned} a = {tidy(value) for value in left} - banned b = {str(value).upper() for value in right} - banned both = a & b listing = sorted returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((min(len(value), 8) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f140(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 141 ```python def f141(spans, gap): spans = list(spans) segments = [] for left, right in sorted(spans): if not segments or left > segments[-1][1] + max(0, gap) + 1: 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 ``` ``` f141([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 142 ```python def f142(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 = [] layers = [] while len(complete) < len(nodes): available = sorted((node for node in nodes if incoming[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) sequence.append(node) for node in current: for nxt in children[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 ``` ``` f142(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 143 ```python def f143(left, right, banned): left = list(left) def normalize(value): return ' '.join(str(value).split()).upper()[:12] banned = {normalize(value) for value in banned} a = {normalize(value) for value in left if normalize(value) != normalize(value) or normalize(value) != ''} - banned b = {normalize(value) for value in right} - banned both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f143(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 144 ```python def f144(left, right, ignored): left = list(left) def tidy(value): return str(value).strip().upper() ignored = {tidy(value) for value in ignored} a = {tidy(value) for value in left} - ignored b = {str(value).upper() for value in right} - ignored both = a & b result = sorted returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f144(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 145 ```python def f145(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 rootsource = dict(incoming) handled = set() sequence = [] groups = [] 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 groups.append(current) for node in current: handled.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 ``` ``` f145(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 146 ```python def f146(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: 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] = tallies.get(word, 0) + 1 ranking = 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 ranking[:5]], 'initials': starts, 'size': sum((len(word) * count for word, count in tallies.items()))} output = dict() output.update(returnvalue) return output ``` ``` f146(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 147 ```python def f147(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 += 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, 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 ``` ``` f147([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 148 ```python def f148(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(windows), 'hits': indexes, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f148([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 149 ```python def f149(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] ups = sum((1 for pos in range(1, min(65, len(windows))) if windows[pos] >= windows[pos - 1])) returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': matches, 'rises': ups} output = dict() output.update(returnvalue) return output ``` ``` f149([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 150 ```python def f150(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) 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': matches, 'rises': ups} output = dict() output.update(returnvalue) return output ``` ``` f150([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 151 ```python def f151(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 = 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 ``` ``` f151([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 152 ```python def f152(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([0] + windows), 'hits': indexes, 'rises': ups} output = dict() output.update(returnvalue) return output ``` ``` f152([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 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] 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([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 154 ```python def f154(nodes, edges): nodes = list(nodes) incoming = {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) incoming[b] += 1 rootsource = dict(incoming) finished = set() result = [] layers = [] 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), 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) result.append(node) for node in current: for nxt in nextmap[node]: incoming[nxt] -= 1 returnvalue = {'order': result, 'batches': layers, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(result)} output = dict() output.update(returnvalue) return output ``` ``` f154(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 155 ```python def f155(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 = (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 ``` ``` f155([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 156 ```python def f156(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 startdegree = dict(needs) complete = set() listing = [] 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) 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 ``` ``` f156(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 157 ```python def f157(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 sorteditems = 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 sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f157(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 158 ```python def f158(left, right, excluded): left = list(left) def normalize(value): return str(value).strip().upper() excluded = {normalize(value) for value in excluded} a = {normalize(value) for value in left} - excluded b = {normalize(value) for value in right} - excluded both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f158(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 159 ```python def f159(board): board = list(board) visited = set() regions = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(len(board[row])): if board[row][col] != '#' or (row, col) in visited: continue cells = [] work = [(row, col)] visited.add((row, col)) while work: cur = work.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) work.append(nxt) regions.append((len(cells), min(cells))) regions.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)} output = dict() output.update(returnvalue) return output ``` ``` f159(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 160 ```python def f160(board): board = list(board) visited = set() regions = [] for row in range(len(board)): for col in range(len(board[row])): if col >= 12 or board[row][col] != '#' or (row, col) in visited: continue cells = [] queue = [(row, col)] visited.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) if len(visited) >= 100: continue queue.append(nxt) regions.append((len(cells), min(cells))) regions.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)} output = dict() output.update(returnvalue) return output ``` ``` f160(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 161 ```python def f161(values, width, limit): values = list(values) size = width series = [] for pos in range(min(64, 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(series), 'hits': indexes, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f161([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 162 ```python def f162(left, right, ignored): left = list(left) def tidy(value): return str(value).strip().upper() ignored = {str(value).upper() for value in ignored} a = {tidy(value) for value in left} - ignored b = {tidy(value) for value in right} - ignored both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f162(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 163 ```python def f163(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] = 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 ``` ``` f163([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 164 ```python def f164(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 {} pending = [start] while pending: cur = pending.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 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 ``` ``` f164([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 165 ```python def f165(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[:64]) 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': matches, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f165([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 166 ```python def f166(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) 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': min(256, max(windows)), 'hits': matches, 'rises': ups} output = dict() output.update(returnvalue) return output ``` ``` f166([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 167 ```python def f167(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 = min(64, 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 ``` ``` f167([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 168 ```python def f168(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 ``` ``` f168([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 169 ```python def f169(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, 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 ``` ``` f169([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 170 ```python def f170(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) listing = list(levels) furthest = sorted((node for node in levels if levels[node] == max(levels.values()))) returnvalue = {'order': listing, 'depth': levels, 'frontier': furthest, 'count': len(levels)} output = dict() output.update(returnvalue) return output ``` ``` f170([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 171 ```python def f171(board): board = list(board) visited = set() components = [] for row in range(len(board)): for col in range(len(board[0])): if board[row][col] != '#' or (row, col) in visited: continue cells = [] queue = [(row, col)] visited.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) queue.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f171(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 172 ```python def f172(board): board = list(board) visited = set() components = [] for row in range(len(board)): for col in range(len(board[row])): if col >= 12 or board[row][col] != '#' or (row, col) in visited: continue cells = [] queue = [(row, col)] visited.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) queue.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f172(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 173 ```python def f173(left, right, ignored): left = list(left) def normalize(value): return ' '.join(str(value).split()).upper() ignored = {normalize(value) for value in ignored} a = {normalize(value) for value in left} - ignored b = {str(value).upper() for value in right} - ignored both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f173(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 174 ```python def f174(lines, stop): lines = list(lines) tallies = {} stop = {str(word) for word in stop} tokens = [] for line in lines: 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 or len(word) > 12: 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 ``` ``` f174(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 175 ```python def f175(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) 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 ``` ``` f175([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 176 ```python def f176(left, right, ignored): left = list(left) def normalize(value): return str(value).strip().upper() ignored = {normalize(value) for value in ignored} a = {normalize(value) for value in left} - ignored b = {normalize(value) for value in right} - ignored both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f176(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 177 ```python def f177(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 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 ``` ``` f177(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 178 ```python def f178(left, right, banned): left = list(left) def normalize(value): return str(value).strip(' ').upper() banned = {normalize(value) for value in banned} a = {normalize(value) for value in left} - banned b = {str(value).upper() for value in right} - banned both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f178(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 179 ```python def f179(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() listing = [] 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) 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 initial[node] == 0)), 'count': len(listing)} output = dict() output.update(returnvalue) return output ``` ``` f179(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 180 ```python def f180(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 sorted(routes.get(cur, [])): 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 ``` ``` f180([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 181 ```python def f181(board): board = list(board) known = set() components = [] for row in range(len(board)): for col in range(len(board[0])): if board[row][col] != '#' or (row, col) in known: continue cells = [] queue = [(row, col)] known.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known): known.add(nxt) if len(known) >= 100: continue queue.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f181(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 182 ```python def f182(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 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 ``` ``` f182([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 183 ```python def f183(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(0, result[-1][1], right) spaces = [] for pos in range(1, len(result)): left = result[pos][0] spaces.append(min(100, left - result[pos - 1][1])) returnvalue = {'segments': result, 'cover': sum((right - left for left, right in result)), 'holes': spaces, 'longest': min(100, max((right - left for left, right in result)))} output = dict() output.update(returnvalue) return output ``` ``` f183([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 184 ```python def f184(edges, start, limit): edges = list(edges) children = {} for a, b in edges: children.setdefault(a, []).append(b) distance = {start: 0} 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) 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 ``` ``` f184([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 185 ```python def f185(left, right, banned): left = list(left) def normalize(value): return str(value).strip(' \r').upper() banned = {normalize(value) for value in banned} a = {normalize(value) for value in left} - banned b = {normalize(value) for value in right} - banned both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f185(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 186 ```python def f186(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): x += dx y += dy used = min(64, 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 ``` ``` f186([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 187 ```python def f187(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) steps = {start: 0} queue = [start] while queue: cur = queue.pop(0) if steps[cur] < limit: for nxt in sorted(nextmap.get(cur, []))[:20]: if nxt not in steps and (not nxt.startswith('Z')): steps[nxt] = steps[cur] + 1 queue.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 ``` ``` f187([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 188 ```python def f188(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: if before == after: continue a, b = (before, after) nextmap[a].append(b) needs[b] += 1 initial = dict(needs) complete = set() sequence = [] rounds = [] while len(complete) < len(nodes): nextbatch = sorted((node for node in nodes if needs[node] == 0 and node not in complete)) 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) sequence.append(node) for node in current: for nxt in nextmap[node]: needs[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 ``` ``` f188(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 189 ```python def f189(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: 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 ``` ``` f189([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 190 ```python def f190(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 or len(word) > 12: continue frequency[word] = min(9, 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': min(256, sum((len(word) * count for word, count in frequency.items())))} output = dict() output.update(returnvalue) return output ``` ``` f190(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 191 ```python def f191(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] 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 ``` ``` f191([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 192 ```python def f192(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): 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 = 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 ``` ``` f192([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 193 ```python def f193(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(0, 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 ``` ``` f193([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 194 ```python def f194(edges, start, limit): edges = list(edges) children = {} for a, b in edges: children.setdefault(a, []).append(b) steps = {start: 0} queue = [start] while queue: cur = queue.pop(0) if steps[cur] < min(limit, 3): for nxt in sorted(children.get(cur, []))[:20]: if nxt not in steps: steps[nxt] = steps[cur] + 1 queue.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 ``` ``` f194([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 195 ```python def f195(spans, gap): spans = list(spans) combined = [] for left, right in sorted(set(spans)): if not combined or left > combined[-1][1] + gap + 1: 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 ``` ``` f195([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 196 ```python def f196(values, width, limit): values = list(values) size = width if width > 1 or width < 1 else 2 totals = [] for pos in range(min(64, 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': max(totals), 'hits': matches, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f196([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 197 ```python def f197(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 ``` ``` f197([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 198 ```python def f198(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] 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 ``` ``` f198([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 199 ```python def f199(left, right, ignored): left = list(left) def tidy(value): return ' '.join(str(value).split()).upper() ignored = {tidy(value) for value in ignored} a = {tidy(value) for value in left} - ignored b = {tidy(value) for value in right if tidy(value) != ''} - ignored both = a & b result = sorted returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((min(len(value), 8) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f199(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 200 ```python def f200(board): board = list(board) found = set() pieces = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(len(board[row])): if board[row][col] != '#' or (row, col) in found: continue cells = [] work = [(row, col)] found.add((row, col)) while work: cur = work.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found): found.add(nxt) if len(found) >= 100: continue work.append(nxt) pieces.append((len(cells), min(cells))) pieces.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)} output = dict() output.update(returnvalue) return output ``` ``` f200(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 201 ```python def f201(board): board = list(board) known = set() pieces = [] for row in range(len(board)): for col in range(len(board[0])): if col >= 12 or board[row][col] != '#' or (row, col) in known: continue cells = [] queue = [(row, col)] known.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known): known.add(nxt) if len(known) >= 100: continue queue.append(nxt) pieces.append((len(cells), min(cells))) pieces.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)} output = dict() output.update(returnvalue) return output ``` ``` f201(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 202 ```python def f202(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 and (not nxt.startswith('Z')): 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 ``` ``` f202([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 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(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 204 ```python def f204(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: 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': max((right - left for left, right in result))} output = dict() output.update(returnvalue) return output ``` ``` f204([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 205 ```python def f205(board): board = list(board) visited = set() components = [] for row in range(len(board)): for col in range(len(board[row])): if col >= 12 or board[row][col] != '#' or (row, col) in visited: continue cells = [] queue = [(row, col)] visited.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) if len(visited) >= 100: continue queue.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f205(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 206 ```python def f206(edges, start, limit): edges = list(edges) nextmap = {} for a, b in edges: nextmap.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(nextmap.get(cur, [])): if nxt not in levels: levels[nxt] = levels[cur] + 1 queue.append(nxt) sequence = list(levels) lastlevel = sorted((node for node in levels if levels[node] == max(levels.values()))) returnvalue = {'order': sequence, 'depth': levels, 'frontier': lastlevel, 'count': len(levels)} output = dict() output.update(returnvalue) return output ``` ``` f206([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 207 ```python def f207(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' 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 or len(word) > 12: 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 ``` ``` f207(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 208 ```python def f208(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) 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 ``` ``` f208([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 209 ```python def f209(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(min(count, 64)): x += dx y += dy used = min(64, 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 = (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 ``` ``` f209([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 210 ```python def f210(left, right, excluded): left = list(left) def canon(value): return ' '.join(str(value).split()).upper() excluded = {canon(value) for value in excluded} a = {canon(value) for value in left if canon(value) != canon(value) or canon(value) != ''} - excluded b = {canon(value) for value in right} - excluded both = a & b result = sorted returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f210(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 211 ```python def f211(board): board = list(board) visited = set() components = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(min(len(board[row]), 10)): if board[row][col] != '#' or (row, col) in visited: continue cells = [] pending = [(row, col)] visited.add((row, col)) while pending: cur = pending.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) pending.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f211(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 212 ```python def f212(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) and len(complete) < 20: nextbatch = sorted((node for node in nodes if indegree[node] == 0 and node not in complete), reverse=any((str(node).isupper() for node in nodes))) 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 ``` ``` f212(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 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[:64]) if value >= limit and (limit >= 0 or pos > 0)] increases = sum((1 for pos in range(1, len(windows)) if windows[pos] > windows[pos - 1])) returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': matches, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f213([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 214 ```python def f214(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 initial = 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=len(nodes) > 20) 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 nextmap[node]: indegree[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 ``` ``` f214(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 215 ```python def f215(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[:64]) 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(totals), 'hits': matches, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f215([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 216 ```python def f216(left, right, ignored): left = list(left) def normalize(value): return str(value).strip(' \n').upper() ignored = {normalize(value) for value in ignored} a = {normalize(value) for value in left} - ignored b = {normalize(value) for value in right} - ignored both = a & b listing = sorted returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f216(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 217 ```python def f217(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]))) positions = [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': positions, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f217([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 218 ```python def f218(values, width, limit): values = list(values) size = width if width > 1 or width < 1 else 2 series = [] for pos in range(min(64, len(values) - size + 1)): series.append(sum(values[pos:pos + size])) matches = [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([0] + series), 'hits': matches, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f218([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 219 ```python def f219(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) handled = set() sequence = [] 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 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 ``` ``` f219(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 220 ```python def f220(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) handled = set() result = [] groups = [] while len(handled) < len(nodes): available = sorted((node for node in nodes if needs[node] == 0 and node not in handled), reverse=len(nodes) > 20) if not available: break current = available groups.append(current) for node in current: handled.add(node) result.append(node) for node in current: for nxt in routes[node]: needs[nxt] -= 1 returnvalue = {'order': result, 'batches': groups, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(result)} output = dict() output.update(returnvalue) return output ``` ``` f220(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 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(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 222 ```python def f222(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) < 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 ``` ``` f222(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 223 ```python def f223(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(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 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 ``` ``` f223([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 224 ```python def f224(left, right, banned): left = list(left) def tidy(value): return str(value).strip().upper()[:12] banned = {tidy(value) for value in banned} a = {tidy(value) for value in left if tidy(value) != tidy(value) or tidy(value) != ''} - banned b = {tidy(value) for value in right} - banned both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((min(len(value), 8) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f224(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 225 ```python def f225(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} 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 ``` ``` f225([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 226 ```python def f226(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: 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': min(256, sum((len(word) * count for word, count in wordmap.items())))} output = dict() output.update(returnvalue) return output ``` ``` f226(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 227 ```python def f227(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 ``` ``` f227([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 228 ```python def f228(left, right, banned): left = list(left) def normalize(value): return str(value).strip(' ').upper()[:12] banned = {normalize(value) for value in banned} a = {normalize(value) for value in left} - banned b = {normalize(value) for value in right if normalize(value) != ''} - banned both = a & b result = sorted returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f228(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 229 ```python def f229(board): board = list(board) visited = set() components = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(len(board[0])): if col >= 12 or board[row][col] != '#' or (row, col) in visited: continue cells = [] pending = [(row, col)] visited.add((row, col)) while pending: cur = pending.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) pending.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f229(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 230 ```python def f230(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 ``` ``` f230([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 231 ```python def f231(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(min(100, left - combined[pos - 1][1])) returnvalue = {'segments': combined, 'cover': sum((min(100, 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 ``` ``` f231([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 232 ```python def f232(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, 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 ``` ``` f232([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 233 ```python def f233(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) listing = list(steps) furthest = sorted((node for node in steps if steps[node] == max(steps.values()))) returnvalue = {'order': listing, 'depth': steps, 'frontier': furthest, 'count': len(steps)} output = dict() output.update(returnvalue) return output ``` ``` f233([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 234 ```python def f234(board): board = list(board) found = set() regions = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(len(board[row])): if board[row][col] != '#' or (row, col) in found: continue cells = [] queue = [(row, col)] found.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found): found.add(nxt) queue.append(nxt) regions.append((len(cells), min(cells))) regions.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)} output = dict() output.update(returnvalue) return output ``` ``` f234(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 235 ```python def f235(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, 3 + (count - count))): x += dx y += dy used += 1 point = (x, y) if point in found and list(point) not in crossings: crossings.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': crossings[:5], 'bounds': [lowx, lowy, highx, highy], 'steps': used} output = dict() output.update(returnvalue) return output ``` ``` f235([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 236 ```python def f236(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) 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 ``` ``` f236([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 237 ```python def f237(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((min(100, 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 ``` ``` f237([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 238 ```python def f238(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 += 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 = (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 ``` ``` f238([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 239 ```python def f239(lines, stop): lines = list(lines) tallies = {} 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 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 ``` ``` f239(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 240 ```python def f240(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 = [] 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) 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 initial[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f240(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 241 ```python def f241(left, right, ignored): left = list(left) def canon(value): return str(value).strip().upper()[:12] ignored = {canon(value) for value in ignored} a = {canon(value) for value in left} - ignored b = {canon(value) for value in right} - ignored both = a & b listing = sorted returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f241(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 242 ```python def f242(left, right, excluded): left = list(left) def normalize(value): return ' '.join(str(value).split()).upper() excluded = {normalize(value) for value in excluded} a = {normalize(value) for value in left} - excluded b = {normalize(value) for value in right} - excluded both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f242(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 243 ```python def f243(edges, start, limit): edges = list(edges) routes = {} for a, b in edges: routes.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] < min(limit, 3): for nxt in sorted(routes.get(cur, [])): if nxt not in distance and (not nxt.startswith('Z')): 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, 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f243([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 244 ```python def f244(spans, gap): spans = list(spans) result = [] for left, right in sorted(spans): if not result or left > result[-1][1] + max(0, gap): result.append([left, right]) else: 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 ``` ``` f244([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 245 ```python def f245(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 initial = 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)) 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 children[node]: indegree[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 ``` ``` f245(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 246 ```python def f246(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) finished = set() sequence = [] groups = [] 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 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 initial[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f246(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 247 ```python def f247(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 ``` ``` f247([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 248 ```python def f248(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: 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 ``` ``` f248(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 249 ```python def f249(board): board = list(board) found = set() regions = [] for row in range(len(board)): for col in range(min(len(board[row]), 10)): if board[row][col] != '#' or (row, col) in found: continue cells = [] queue = [(row, col)] found.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found): found.add(nxt) queue.append(nxt) regions.append((len(cells), min(cells))) regions.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)} output = dict() output.update(returnvalue) return output ``` ``` f249(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 250 ```python def f250(left, right, banned): left = list(left) def canon(value): return str(value).strip().upper() banned = {canon(value) for value in banned} a = {canon(value) for value in left} - banned b = {str(value).upper() for value in right} - banned both = a & b listing = sorted returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((min(len(value), 8) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f250(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 251 ```python def f251(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 rootsource = dict(needs) finished = set() sequence = [] rounds = [] while len(finished) < len(nodes): 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 rounds.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': rounds, 'roots': sorted((node for node in nodes if rootsource[node] == 0)), 'count': len(sequence)} output = dict() output.update(returnvalue) return output ``` ``` f251(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 252 ```python def f252(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] = max(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 ``` ``` f252([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 253 ```python def f253(left, right, excluded): left = list(left) def clean(value): return str(value).strip().upper() excluded = {str(value).upper() for value in excluded} a = {str(value).upper() for value in left} - excluded b = {str(value).upper() for value in right} - excluded both = a & b listing = sorted returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f253(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 254 ```python def f254(board): board = list(board) found = set() pieces = [] for row in range(len(board)): for col in range(min(len(board[row]), 10)): if col >= 12 or board[row][col] != '#' or (row, col) in found: continue cells = [] queue = [(row, col)] found.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found): found.add(nxt) queue.append(nxt) pieces.append((len(cells), min(cells))) pieces.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)} output = dict() output.update(returnvalue) return output ``` ``` f254(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 255 ```python def f255(edges, start, limit): edges = list(edges) nextmap = {} for a, b in edges[:16]: 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) 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 ``` ``` f255([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 256 ```python def f256(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])) 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': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f256(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 257 ```python def f257(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} if any((start in edge for edge in edges)) else {} queue = [start] while queue: cur = queue.pop(0) if levels[cur] < limit: for nxt in sorted(children.get(cur, [])): if nxt not in levels: levels[nxt] = levels[cur] + 1 queue.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 ``` ``` f257([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 258 ```python def f258(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): 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, 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 ``` ``` f258([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 259 ```python def f259(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 initial = dict(incoming) complete = set() sequence = [] layers = [] while len(complete) < len(nodes) and len(complete) < 20: 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) sequence.append(node) for node in current: for nxt in children[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 ``` ``` f259(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 260 ```python def f260(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] growth = sum((1 for pos in range(1, 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 ``` ``` f260([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 261 ```python def f261(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) levels = {start: 0} work = [start] while work: cur = work.pop(0) if levels[cur] < limit: for nxt in sorted(routes.get(cur, []))[:20]: if nxt not in levels: levels[nxt] = levels[cur] + 1 work.append(nxt) listing = list(levels) furthest = sorted((node for node in levels if levels[node] == max(levels.values()))) returnvalue = {'order': listing, 'depth': levels, 'frontier': furthest, 'count': len(levels)} output = dict() output.update(returnvalue) return output ``` ``` f261([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 262 ```python def f262(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 ``` ``` f262(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 263 ```python def f263(lines, stop): lines = list(lines) tallies = {} 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 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 ``` ``` f263(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 264 ```python def f264(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': min(256, max(windows)), 'hits': positions, 'rises': ups} output = dict() output.update(returnvalue) return output ``` ``` f264([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 265 ```python def f265(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) 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 ``` ``` f265([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 266 ```python def f266(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] increases = sum((1 for pos in range(1, len(windows)) if windows[pos] >= windows[pos - 1])) returnvalue = {'sums': windows, 'best': max([0] + windows), 'hits': matches, 'rises': increases} output = dict() output.update(returnvalue) return output ``` ``` f266([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 267 ```python def f267(board): board = list(board) visited = set() components = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(min(len(board[row]), 10)): if col >= 12 or board[row][col] != '#' or (row, col) in visited: continue cells = [] work = [(row, col)] visited.add((row, col)) while work: cur = work.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) work.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f267(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 268 ```python def f268(left, right, banned): left = list(left) def normalize(value): return str(value).strip(' \n').upper() banned = {normalize(value) for value in banned} a = {normalize(value) for value in left if normalize(value) != normalize(value) or normalize(value) != ''} - banned b = {normalize(value) for value in right} - banned both = a & b result = sorted returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((min(len(value), 8) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f268(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 269 ```python def f269(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 rootsource = 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=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 children[node]: needs[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 ``` ``` f269(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 270 ```python def f270(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 = 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 ``` ``` f270([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 271 ```python def f271(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 {} 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[:3], 'count': len(distance)} output = dict() output.update(returnvalue) return output ``` ``` f271([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 272 ```python def f272(edges, start, limit): edges = list(edges) nextmap = {} for a, b in edges: nextmap.setdefault(a, []).append(b) levels = {start: 0} queue = [start] while queue: cur = queue.pop(0) if levels[cur] < limit: for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1): if nxt not in levels: levels[nxt] = levels[cur] + 1 queue.append(nxt) listing = list(levels) furthest = sorted((node for node in levels if levels[node] == max(levels.values()))) returnvalue = {'order': listing, 'depth': levels, 'frontier': furthest, 'count': len(levels)} output = dict() output.update(returnvalue) return output ``` ``` f272([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 273 ```python def f273(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() sequence = [] rounds = [] 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 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 ``` ``` f273(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 274 ```python def f274(lines, stop): lines = list(lines) frequency = {} 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 frequency[word] = frequency.get(word, 0) + 1 sorteditems = 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 sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f274(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['ember', 'frost']) ``` ``` {"counts":{"amber":4,"blue":4,"cyan":2,"delta":4,"garnet":3,"helium":8},"initials":{"a":4,"b":4,"c":2,"d":4,"g":3,"h":8},"size":130,"top":["helium","amber","blue","delta","garnet"]} ``` ### 275 ```python def f275(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 initial = dict(incoming) finished = set() sequence = [] 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) sequence.append(node) for node in current: for nxt in children[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 ``` ``` f275(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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"]} ``` ### 276 ```python def f276(board): board = list(board) visited = set() pieces = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(len(board[0])): if board[row][col] != '#' or (row, col) in visited: continue cells = [] queue = [(row, col)] visited.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) if len(visited) >= 100: continue queue.append(nxt) pieces.append((len(cells), min(cells))) pieces.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)} output = dict() output.update(returnvalue) return output ``` ``` f276(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 277 ```python def f277(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 sorteditems = 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 sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f277(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 278 ```python def f278(board): board = list(board) visited = set() regions = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(len(board[row])): if col >= 12 or board[row][col] != '#' or (row, col) in visited: continue cells = [] queue = [(row, col)] visited.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) queue.append(nxt) regions.append((len(cells), min(cells))) regions.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)} output = dict() output.update(returnvalue) return output ``` ``` f278(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 279 ```python def f279(edges, start, limit): edges = list(edges) routes = {} for a, b in edges: routes.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 sorted(routes.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 ``` ``` f279([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 280 ```python def f280(left, right, excluded): left = list(left) def normalize(value): return str(value).strip().upper() excluded = {normalize(value) for value in excluded} a = {normalize(value) for value in left if normalize(value) != normalize(value) or normalize(value) != ''} - excluded b = {str(value).upper() for value in right} - excluded both = a & b result = sorted returnvalue = {'both': result(both), 'left': result(a - b), 'right': result(b - a), 'all': result(a | b), 'score': sum((min(len(value), 8) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f280(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 281 ```python def f281(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) levels = {start: 0} pending = [start] while pending: cur = pending.pop(0) if levels[cur] < limit: for nxt in (node for node in sorted(nextmap.get(cur, [])) if len(str(node)) == 1): if nxt not in levels: levels[nxt] = levels[cur] + 1 pending.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 ``` ``` f281([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], 'A', 0) ``` ``` {"count":1,"depth":{"A":0},"frontier":["A"],"order":["A"]} ``` ### 282 ```python def f282(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((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 ``` ``` f282([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 283 ```python def f283(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] + min(gap, 2): 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 ``` ``` f283([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 284 ```python def f284(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 ``` ``` f284([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 285 ```python def f285(board): board = list(board) known = set() components = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(min(len(board[row]), 10)): if board[row][col] != '#' or (row, col) in known: continue cells = [] work = [(row, col)] known.add((row, col)) while work: cur = work.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known): known.add(nxt) if len(known) >= 100: continue work.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f285(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### 286 ```python def f286(spans, gap): spans = list(spans) segments = [] for left, right in sorted(spans): if not segments or left > segments[-1][1] + gap + 1: segments.append([left, right]) else: segments[-1][1] = max(0, 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 ``` ``` f286([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 287 ```python def f287(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 += 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, 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 ``` ``` f287([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 288 ```python def f288(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) 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(nextmap.get(cur, [])): 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 ``` ``` f288([('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F'), ('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B')], '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"]} ``` ### 289 ```python def f289(board): board = list(board) visited = set() pieces = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(len(board[0])): if col >= 12 or board[row][col] != '#' or (row, col) in visited: continue cells = [] queue = [(row, col)] visited.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) queue.append(nxt) pieces.append((len(cells), min(cells))) pieces.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)} output = dict() output.update(returnvalue) return output ``` ``` f289(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 290 ```python def f290(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, min(65, 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 ``` ``` f290([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 291 ```python def f291(board): board = list(board) visited = set() regions = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(min(len(board[row]), 10)): if col >= 12 or board[row][col] != '#' or (row, col) in visited: continue cells = [] queue = [(row, col)] visited.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) queue.append(nxt) regions.append((len(cells), min(cells))) regions.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in regions], 'anchors': [list(anchor) for size, anchor in regions], 'filled': sum((size for size, anchor in regions)), 'count': len(regions)} output = dict() output.update(returnvalue) return output ``` ``` f291(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 292 ```python def f292(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): 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 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 ``` ``` f292([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 293 ```python def f293(board): board = list(board) known = set() pieces = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(min(len(board[row]), 10)): if board[row][col] != '#' or (row, col) in known: continue cells = [] queue = [(row, col)] known.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in known): known.add(nxt) if len(known) >= 100: continue queue.append(nxt) pieces.append((len(cells), min(cells))) pieces.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in pieces], 'anchors': [list(anchor) for size, anchor in pieces], 'filled': sum((size for size, anchor in pieces)), 'count': len(pieces)} output = dict() output.update(returnvalue) return output ``` ``` f293(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 294 ```python def f294(board): board = list(board) found = set() components = [] for row in range(len(board)): for col in range(len(board[row])): if board[row][col] != '#' or (row, col) in found: continue cells = [] work = [(row, col)] found.add((row, col)) while work: cur = work.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found): found.add(nxt) work.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f294(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 295 ```python def f295(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): x += dx y += dy used = min(64, 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 = (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 ``` ``` f295([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 296 ```python def f296(board): board = list(board) visited = set() components = [] for row in range(len(board)): for col in range(min(len(board[row]), 10)): if board[row][col] != '#' or (row, col) in visited: continue cells = [] queue = [(row, col)] visited.add((row, col)) while queue: cur = queue.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in visited): visited.add(nxt) if len(visited) >= 100: continue queue.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f296(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 297 ```python def f297(values, width, limit): values = list(values) size = width series = [] for pos in range(len(values) - size + 1): series.append(sum(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 ``` ``` f297([10, 23, 7, 8, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[0,1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[48,58,52,61,65,68,61,69,64,49,48,35]} ``` ### 298 ```python def f298(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): 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 ``` ``` f298([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 299 ```python def f299(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(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 ``` ``` f299([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 300 ```python def f300(values, width, limit): values = list(values) size = width series = [] for pos in range(len(values) - size + 1): series.append(sum(values[pos:pos + size])) matches = [pos for pos, value in enumerate(series[:64]) if value >= limit and (limit >= 0 or pos > 0)] 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 ``` ``` f300([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 301 ```python def f301(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) finished = set() listing = [] layers = [] 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 layers.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': layers, 'roots': sorted((node for node in nodes if initial[node] == 0)), 'count': len(listing)} output = dict() output.update(returnvalue) return output ``` ``` f301(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('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(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 = [] rounds = [] 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)) 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]: needs[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 ``` ``` f302(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 303 ```python def f303(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: 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 ``` ``` f303(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 304 ```python def f304(board): board = list(board) found = set() components = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(len(board[row])): if col >= 12 or board[row][col] != '#' or (row, col) in found: continue cells = [] pending = [(row, col)] found.add((row, col)) while pending: cur = pending.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found): found.add(nxt) pending.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f304(['...#..', '......', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,3],[2,3],[3,2],[3,5],[4,3]],"count":6,"filled":7,"sizes":[2,1,1,1,1,1]} ``` ### 305 ```python def f305(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(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 = (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 ``` ``` f305([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1)]) ``` ``` {"bounds":[0,-3,11,6],"end":[10,4],"far":16,"revisits":[[5,5],[5,4],[11,4]],"steps":32} ``` ### 306 ```python def f306(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: segments.append([left, right]) else: 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 ``` ``` f306([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 307 ```python def f307(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])) 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 sorteditems[:5]], 'initials': letters, 'size': sum((len(word) * count for word, count in frequency.items()))} output = dict() output.update(returnvalue) return output ``` ``` f307(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 308 ```python def f308(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) 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 ``` ``` f308([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 309 ```python def f309(left, right, banned): left = list(left) def normalize(value): return str(value).strip(' \n').upper() banned = {str(value).upper() for value in banned} a = {normalize(value) for value in left} - banned b = {normalize(value) for value in right} - banned both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f309(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 310 ```python def f310(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] growth = sum((1 for pos in range(1, len(series)) if series[pos] > series[pos - 1])) returnvalue = {'sums': series, 'best': max(series), 'hits': indexes, 'rises': growth} output = dict() output.update(returnvalue) return output ``` ``` f310([10, 25, 7, 4, 20, 17, 16, 12, 23, 10, 24, 7, 8, 9, 11], 4, 48) ``` ``` {"best":69,"hits":[1,2,3,4,5,6,7,8,9,10],"rises":5,"sums":[46,56,48,57,65,68,61,69,64,49,48,35]} ``` ### 311 ```python def f311(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] = max(result[-1][1], right) gaps = [] for pos in range(1, len(result)): left = result[pos][0] gaps.append(min(100, 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 ``` ``` f311([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 2) ``` ``` {"cover":40,"holes":[6,7,3,8],"longest":12,"segments":[[2,8],[14,21],[28,40],[43,51],[59,66]]} ``` ### 312 ```python def f312(lines, stop): lines = list(lines) tallies = {} 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 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 ``` ``` f312(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 313 ```python def f313(left, right, ignored): left = list(left) def tidy(value): return ' '.join(str(value).split()).upper() ignored = {str(value).upper() for value in ignored} a = {str(value).upper() for value in left} - ignored b = {tidy(value) for value in right} - ignored both = a & b sequence = sorted returnvalue = {'both': sequence(both), 'left': sequence(a - b), 'right': sequence(b - a), 'all': sequence(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f313(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['cyan ']) ``` ``` {"all":["BLUE","DELTA","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["DELTA"],"right":["GARNET","HELIUM"],"score":19} ``` ### 314 ```python def f314(left, right, ignored): left = list(left) def tidy(value): return str(value).strip().upper()[:12] ignored = {tidy(value) for value in ignored} a = {tidy(value) for value in left} - ignored b = {str(value).upper() for value in right} - ignored both = a & b listing = sorted returnvalue = {'both': listing(both), 'left': listing(a - b), 'right': listing(b - a), 'all': listing(a | b), 'score': sum((len(value) for value in both))} output = dict() output.update(returnvalue) return output ``` ``` f314(['BLUE', 'frost', 'Ember', 'ivory', 'cyan ', 'delta', 'Ember'], ['frost', 'BLUE', 'Ember', 'GARNET', 'ivory', 'helium', 'Ember'], ['delta']) ``` ``` {"all":["BLUE","CYAN","EMBER","FROST","GARNET","HELIUM","IVORY"],"both":["BLUE","EMBER","FROST","IVORY"],"left":["CYAN"],"right":["GARNET","HELIUM"],"score":19} ``` ### 315 ```python def f315(lines, stop): lines = list(lines) frequency = {} stop = {word.lower() for word in stop} terms = [] for line in lines[:20]: text = line.lower() word = '' for char in text[:64]: 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 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 ``` ``` f315(['Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber', 'Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta'], ['blue', 'cyan']) ``` ``` {"counts":{"amber":4,"delta":4,"ember":4,"frost":2,"garnet":3,"helium":8},"initials":{"a":4,"d":4,"e":4,"f":2,"g":3,"h":8},"size":136,"top":["helium","amber","delta","ember","garnet"]} ``` ### 316 ```python def f316(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 startdegree = dict(indegree) finished = set() result = [] layers = [] 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 layers.append(current) for node in current: finished.add(node) result.append(node) for node in current: for nxt in children[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 ``` ``` f316(['proxy', 'api', 'worker', 'ui', 'cache', 'db', 'jobs', 'auth'], [('auth', 'api'), ('db', 'api'), ('cache', 'api'), ('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache')]) ``` ``` {"batches":[["auth","db"],["cache","jobs","proxy"],["api","worker"],["ui"]],"count":8,"order":["auth","db","cache","jobs","proxy","api","worker","ui"],"roots":["auth","db"]} ``` ### 317 ```python def f317(spans, gap): spans = list(spans) segments = [] for left, right in sorted(spans): if not segments or left > segments[-1][1] + gap % 5 + 1: 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((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 ``` ``` f317([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 318 ```python def f318(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[:20]: 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 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 ``` ``` f318([('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1), ('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2)]) ``` ``` {"bounds":[0,-3,11,6],"end":[11,2],"far":16,"revisits":[[5,5],[5,4],[11,4],[11,3],[11,2]],"steps":33} ``` ### 319 ```python def f319(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 + 1: 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 ``` ``` f319([(2, 8), (5, 8), (14, 19), (18, 21), (28, 34), (33, 40), (43, 47), (48, 51), (59, 66)], 3) ``` ``` {"cover":43,"holes":[6,7,8],"longest":23,"segments":[[2,8],[14,21],[28,51],[59,66]]} ``` ### 320 ```python def f320(board): board = list(board) found = set() components = [] for row in range(min(len(board), 10 + (len(board) - len(board)))): for col in range(len(board[row])): if col >= 12 or board[row][col] != '#' or (row, col) in found: continue cells = [] pending = [(row, col)] found.add((row, col)) while pending: cur = pending.pop() cells.append(cur) for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)): nxt = (cur[0] + dr, cur[1] + dc) if 0 <= nxt[0] < len(board) and 0 <= nxt[1] < len(board[nxt[0]]) and (nxt[1] < 12) and (board[nxt[0]][nxt[1]] == '#') and (nxt not in found): found.add(nxt) if len(found) >= 100: continue pending.append(nxt) components.append((len(cells), min(cells))) components.sort(key=lambda item: (-item[0], item[1])) returnvalue = {'sizes': [size for size, anchor in components], 'anchors': [list(anchor) for size, anchor in components], 'filled': sum((size for size, anchor in components)), 'count': len(components)} output = dict() output.update(returnvalue) return output ``` ``` f320(['#..#..', '.....#', '...#..', '#.#..#', '#..#..', '......']) ``` ``` {"anchors":[[3,0],[0,0],[0,3],[1,5],[2,3],[3,2],[3,5],[4,3]],"count":8,"filled":9,"sizes":[2,1,1,1,1,1,1,1]} ``` ### Final Query Give me the output of the final query without executing it! ```python import json, re from collections import deque out = {} edges = list((('A', 'C'), ('A', 'B'), ('B', 'D'), ('B', 'E'), ('C', 'F')) + (('D', 'G'), ('E', 'G'), ('F', 'H'), ('G', 'A'), ('C', 'E'), ('H', 'B'))) start = 'A' limit = 0 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)} token = record['dd'] nodes = list(('proxy', 'api', 'worker') + ('ui', 'cache', 'db', 'jobs', 'auth')) route = token cases = { 8: list((('auth', 'api'), ('db', 'api'), ('cache', 'api')) + (('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('auth', 'cache'))), 1: list((('auth', 'api'), ('db', 'api'), ('cache', 'api')) + (('api', 'ui'), ('db', 'jobs'), ('jobs', 'worker'), ('auth', 'proxy'), ('cache', 'auth'))), } 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)} memo = record['aa'][0] left = list(('BLUE', 'frost', 'Ember', 'ivory') + ('cyan ', 'delta', 'Ember')) right = list(('frost', 'BLUE', 'Ember', 'GARNET') + ('ivory', 'helium', 'Ember')) route = memo cases = { 'cache': ['cyan '], 'auth': ['delta'], } blocked = cases[route] a = set() b = set() ban = set() for value in blocked: ban.add(value.strip().upper()) for value in left: value = value.strip().upper() if value not in ban: a.add(value) for value in right: value = value.strip().upper() if value not in ban: b.add(value) both = a.intersection(b) record = {'aa': sorted(both), 'bb': sorted(a.difference(b)), 'cc': sorted(b.difference(a)), 'dd': sorted(a.union(b)), 'ee': sum(map(len, both))} clue = record['bb'][0] spans = list(((2, 8), (5, 8), (14, 19), (18, 21)) + ((28, 34), (33, 40), (43, 47), (48, 51), (59, 66))) route = clue cases = { 'CYAN': 2, 'DELTA': 3, } 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))} stamp = record['cc'] width = 4 limit = 48 route = memo cases = { 'cache': list((10, 23, 7, 8, 20, 17) + (16, 12, 23, 10, 24, 7, 8, 9, 11)), 'auth': list((10, 25, 7, 4, 20, 17) + (16, 12, 23, 10, 24, 7, 8, 9, 11)), } values = 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} ticket = record['aa'][0] lines = list(('Amber, helium. helium helium', 'Ember, frost. blue helium garnet', 'Ember, blue. helium frost', 'Garnet, cyan. helium blue amber') + ('Cyan, ember. amber delta', 'Ember, delta. helium amber blue', 'Helium, delta. garnet delta')) route = (stamp, ticket) cases = { (40, 1): list(('ember',) + ('frost',)), (40, 0): list(('ember',) + ('frost',)), (43, 1): list(('ember',) + ('frost',)), (43, 0): list(('blue',) + ('cyan',)), } 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))} badge = record['dd'] route = badge cases = { 136: list(('#..#..', '.....#', '...#..') + ('#.#..#', '#..#..', '......')), 130: list(('...#..', '......', '...#..') + ('#.#..#', '#..#..', '......')), } board = cases[route] cells = [(row, col) for row in range(len(board)) for col in range(len(board[row])) if board[row][col] == '#'] parent = {cell: cell for cell in cells} def root(cell): while parent[cell] != cell: parent[cell] = parent[parent[cell]] cell = parent[cell] return cell def merge(a, b): a = root(a) b = root(b) if a != b: parent[b] = a for row, col in cells: for other in ((row - 1, col), (row, col - 1)): if other in parent: merge((row, col), other) groups = {} for cell in cells: groups.setdefault(root(cell), []).append(cell) parts = [(len(group), min(group)) for group in groups.values()] parts.sort(key=lambda item: (-item[0], item[1])) record = {'aa': [part[0] for part in parts], 'bb': [list(part[1]) for part in parts], 'cc': len(cells), 'dd': len(parts)} permit = record['cc'] route = permit cases = { 7: list((('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1)) + (('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('S', 2))), 9: list((('E', 3), ('S', 3), ('E', 1), ('N', 2), ('N', 3), ('E', 1), ('N', 1)) + (('N', 3), ('S', 2), ('E', 3), ('E', 1), ('S', 2), ('E', 2), ('N', 3), ('S', 1), ('W', 1))), } 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} out['aa'] = record['aa'] out['bb'] = record['bb'] out['cc'] = record['cc'] out['dd'] = record['dd'] out['ee'] = record['ee'] print(json.dumps(out, separators=(",", ":"), sort_keys=True)) ```