{ "merge-intervals": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s00": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s00": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s00": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s00": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s00": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s00": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s00": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s00": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s00": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s00": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s00": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s00": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s00": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s00": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s00": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s00": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s00": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s00": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s00": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s00": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s00": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s00": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s00": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s00": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s00": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s00": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s00": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s00": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s00": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s00": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s00": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s00": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s00": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s00": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s00": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s00": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s01": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s01": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s01": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s01": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s01": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s01": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s01": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s01": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s01": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s01": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s01": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s01": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s01": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s01": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s01": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s01": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s01": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s01": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s01": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s01": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s01": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s01": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s01": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s01": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s01": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s01": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s01": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s01": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s01": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s01": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s01": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s01": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s01": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s01": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s01": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s01": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s01": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s01": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s01": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s01": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s01": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s01": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s01": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s01": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s01": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s01": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s01": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s01": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s02": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s02": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s02": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s02": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s02": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s02": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s02": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s02": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s02": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s02": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s02": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s02": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s02": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s02": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s02": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s02": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s02": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s02": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s02": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s02": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s02": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s02": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s02": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s02": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s02": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s02": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s02": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s02": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s02": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s02": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s02": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s02": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s02": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s02": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s02": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s02": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s02": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s02": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s02": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s02": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s02": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s02": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s02": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s02": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s02": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s02": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s02": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s02": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s03": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s03": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s03": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s03": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s03": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s03": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s03": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s03": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s03": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s03": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s03": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s03": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s03": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s03": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s03": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s03": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s03": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s03": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s03": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s03": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s03": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s03": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s03": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s03": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s03": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s03": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s03": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s03": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s03": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s03": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s03": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s03": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s03": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s03": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s03": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s03": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s03": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s03": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s03": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s03": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s03": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s03": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s03": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s03": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s03": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s03": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s03": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s03": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s04": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s04": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s04": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s04": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s04": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s04": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s04": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s04": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s04": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s04": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s04": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s04": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s04": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s04": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s04": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s04": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s04": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s04": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s04": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s04": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s04": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s04": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s04": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s04": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s04": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s04": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s04": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s04": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s04": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s04": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s04": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s04": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s04": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s04": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s04": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s04": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s04": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s04": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s04": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s04": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s04": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s04": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s04": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s04": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s04": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s04": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s04": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s04": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s05": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s05": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s05": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s05": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s05": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s05": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s05": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s05": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s05": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s05": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s05": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s05": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s05": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s05": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s05": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s05": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s05": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s05": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s05": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s05": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s05": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s05": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s05": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s05": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s05": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s05": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s05": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s05": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s05": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s05": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s05": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s05": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s05": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s05": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s05": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s05": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s05": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s05": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s05": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s05": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s05": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s05": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s05": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s05": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s05": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s05": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s05": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s05": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s06": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s06": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s06": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s06": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s06": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s06": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s06": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s06": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s06": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s06": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s06": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s06": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s06": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s06": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s06": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s06": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s06": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s06": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s06": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s06": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s06": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s06": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s06": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s06": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s06": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s06": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s06": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s06": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s06": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s06": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s06": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s06": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s06": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s06": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s06": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s06": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s06": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s06": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s06": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s06": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s06": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s06": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s06": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s06": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s06": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s06": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s06": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s06": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s07": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s07": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s07": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s07": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s07": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s07": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s07": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s07": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s07": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s07": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s07": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s07": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s07": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s07": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s07": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s07": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s07": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s07": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s07": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s07": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s07": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s07": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s07": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s07": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s07": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s07": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s07": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s07": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s07": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s07": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s07": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s07": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s07": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s07": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s07": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s07": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s07": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s07": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s07": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s07": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s07": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s07": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s07": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s07": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s07": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s07": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s07": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s07": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s08": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s08": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s08": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s08": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s08": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s08": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s08": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s08": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s08": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s08": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s08": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s08": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s08": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s08": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s08": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s08": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s08": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s08": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s08": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s08": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s08": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s08": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s08": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s08": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s08": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s08": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s08": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s08": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s08": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s08": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s08": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s08": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s08": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s08": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s08": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s08": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s08": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s08": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s08": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s08": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s08": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s08": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s08": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s08": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s08": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s08": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s08": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s08": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s09": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s09": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s09": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s09": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s09": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s09": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s09": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s09": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s09": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s09": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s09": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s09": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s09": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s09": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s09": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s09": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s09": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s09": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s09": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s09": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s09": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s09": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s09": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s09": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s09": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s09": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s09": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s09": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s09": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s09": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s09": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s09": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s09": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s09": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s09": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s09": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s09": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s09": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s09": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s09": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s09": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s09": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s09": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s09": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s09": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s09": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s09": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s09": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s10": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s10": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s10": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s10": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s10": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s10": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s10": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s10": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s10": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s10": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s10": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s10": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s10": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s10": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s10": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s10": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s10": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s10": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s10": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s10": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s10": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s10": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s10": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s10": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s10": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s10": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s10": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s10": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s10": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s10": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s10": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s10": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s10": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s10": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s10": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s10": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s10": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s10": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s10": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s10": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s10": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s10": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s10": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s10": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s10": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s10": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s10": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s10": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s11": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s11": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s11": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s11": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s11": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s11": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s11": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s11": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s11": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s11": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s11": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s11": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s11": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s11": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s11": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s11": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s11": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s11": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s11": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s11": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s11": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s11": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s11": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s11": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s11": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s11": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s11": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s11": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s11": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s11": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s11": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s11": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s11": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s11": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s11": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s11": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s11": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s11": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s11": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s11": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s11": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s11": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s11": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s11": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s11": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s11": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s11": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s11": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s12": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s12": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s12": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s12": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s12": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s12": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s12": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s12": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s12": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s12": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s12": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s12": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s12": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s12": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s12": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s12": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s12": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s12": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s12": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s12": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s12": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s12": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s12": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s12": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s12": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s12": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s12": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s12": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s12": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s12": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s12": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s12": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s12": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s12": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s12": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s12": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s12": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s12": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s12": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s12": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s12": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s12": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s12": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s12": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s12": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s12": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s12": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s12": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s13": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s13": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s13": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s13": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s13": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s13": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s13": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s13": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s13": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s13": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s13": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s13": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s13": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s13": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s13": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s13": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s13": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s13": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s13": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s13": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s13": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s13": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s13": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s13": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s13": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s13": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s13": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s13": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s13": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s13": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s13": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s13": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s13": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s13": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s13": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s13": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s13": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s13": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s13": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s13": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s13": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s13": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s13": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s13": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s13": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s13": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s13": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s13": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s14": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s14": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s14": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s14": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s14": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s14": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s14": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s14": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s14": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s14": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s14": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s14": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s14": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s14": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s14": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s14": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s14": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s14": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s14": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s14": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s14": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s14": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s14": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s14": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s14": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s14": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s14": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s14": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s14": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s14": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s14": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s14": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s14": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s14": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s14": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s14": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s14": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s14": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s14": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s14": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s14": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s14": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s14": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s14": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s14": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s14": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s14": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s14": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s15": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s15": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s15": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s15": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s15": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s15": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s15": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s15": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s15": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s15": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s15": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s15": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s15": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s15": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s15": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s15": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s15": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s15": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s15": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s15": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s15": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s15": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s15": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s15": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s15": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s15": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s15": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s15": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s15": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s15": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s15": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s15": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s15": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s15": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s15": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s15": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s15": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s15": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s15": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s15": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s15": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s15": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s15": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s15": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s15": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s15": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s15": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s15": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s16": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s16": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s16": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s16": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s16": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s16": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s16": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s16": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s16": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s16": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s16": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s16": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s16": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s16": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s16": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s16": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s16": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s16": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s16": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s16": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s16": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s16": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s16": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s16": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s16": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s16": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s16": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s16": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s16": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s16": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s16": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s16": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s16": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s16": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s16": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s16": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s16": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s16": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s16": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s16": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s16": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s16": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s16": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s16": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s16": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s16": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s16": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s16": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s17": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s17": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s17": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s17": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s17": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s17": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s17": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s17": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s17": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s17": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s17": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s17": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s17": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s17": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s17": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s17": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s17": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s17": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s17": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s17": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s17": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s17": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s17": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s17": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s17": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s17": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s17": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s17": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s17": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s17": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s17": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s17": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s17": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s17": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s17": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s17": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s17": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s17": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s17": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s17": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s17": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s17": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s17": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s17": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s17": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s17": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s17": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s17": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s18": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s18": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s18": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s18": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s18": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s18": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s18": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s18": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s18": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s18": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s18": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s18": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s18": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s18": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s18": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s18": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s18": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s18": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s18": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s18": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s18": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s18": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s18": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s18": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s18": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s18": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s18": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s18": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s18": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s18": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s18": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s18": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s18": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s18": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s18": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s18": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s18": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s18": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s18": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s18": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s18": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s18": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s18": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s18": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s18": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s18": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s18": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s18": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s19": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s19": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s19": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s19": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s19": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s19": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s19": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s19": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s19": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s19": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s19": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s19": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s19": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s19": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s19": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s19": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s19": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s19": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s19": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s19": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s19": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s19": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s19": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s19": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s19": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s19": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s19": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s19": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s19": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s19": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s19": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s19": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s19": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s19": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s19": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s19": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s19": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s19": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s19": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s19": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s19": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s19": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s19": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s19": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s19": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s19": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s19": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s19": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s20": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s20": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s20": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s20": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s20": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s20": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s20": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s20": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s20": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s20": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s20": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s20": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s20": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s20": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s20": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s20": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s20": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s20": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s20": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s20": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s20": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s20": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s20": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s20": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s20": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s20": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s20": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s20": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s20": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s20": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s20": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s20": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s20": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s20": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s20": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s20": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s20": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s20": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s20": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s20": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s20": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s20": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s20": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s20": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s20": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s20": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s20": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s20": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s21": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s21": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s21": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s21": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s21": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s21": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s21": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s21": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s21": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s21": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s21": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s21": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s21": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s21": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s21": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s21": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s21": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s21": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s21": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s21": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s21": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s21": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s21": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s21": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s21": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s21": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s21": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s21": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s21": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s21": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s21": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s21": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s21": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s21": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s21": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s21": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s21": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s21": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s21": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s21": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s21": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s21": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s21": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s21": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s21": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s21": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s21": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s21": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s22": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s22": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s22": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s22": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s22": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s22": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s22": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s22": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s22": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s22": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s22": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s22": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s22": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s22": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s22": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s22": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s22": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s22": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s22": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s22": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s22": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s22": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s22": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s22": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s22": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s22": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s22": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s22": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s22": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s22": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s22": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s22": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s22": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s22": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s22": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s22": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s22": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s22": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s22": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s22": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s22": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s22": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s22": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s22": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s22": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s22": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s22": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s22": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s23": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s23": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s23": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s23": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s23": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s23": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s23": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s23": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s23": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s23": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s23": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s23": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s23": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s23": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s23": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s23": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s23": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s23": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s23": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s23": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s23": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s23": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s23": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s23": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s23": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s23": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s23": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s23": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s23": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s23": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s23": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s23": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s23": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s23": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s23": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s23": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s23": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s23": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s23": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s23": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s23": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s23": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s23": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s23": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s23": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s23": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s23": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s23": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "merge-intervals-b0-s24": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b1-s24": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b2-s24": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "merge-intervals-b3-s24": "def solve(intervals):\n out = []\n for a,b in sorted(intervals):\n if out and a <= out[-1][1]:\n out[-1][1] = max(b, out[-1][1])\n else:\n out.append([a,b])\n return out\n", "moving-sums-b0-s24": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b1-s24": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b2-s24": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "moving-sums-b3-s24": "def solve(values,k):\n if k <= 0 or k > len(values): return []\n return [sum(values[i:i+k]) for i in range(len(values)-k+1)]\n", "weighted-mean-b0-s24": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b1-s24": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b2-s24": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "weighted-mean-b3-s24": "def solve(values,weights):\n total = sum(weights)\n return sum(x*w for x,w in zip(values,weights))/total if total else None\n", "stable-unique-b0-s24": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b1-s24": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b2-s24": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "stable-unique-b3-s24": "def solve(values):\n seen = set()\n out = []\n for x in values:\n if x not in seen:\n seen.add(x)\n out.append(x)\n return out\n", "run-length-b0-s24": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b1-s24": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b2-s24": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "run-length-b3-s24": "def solve(text):\n out = []\n for c in text:\n if out and out[-1][0] == c: out[-1][1] += 1\n else: out.append([c,1])\n return out\n", "luhn-b0-s24": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b1-s24": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b2-s24": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "luhn-b3-s24": "def solve(text):\n if not text or any(c not in '0123456789' for c in text): return False\n total = 0\n for i,c in enumerate(reversed(text)):\n v = int(c)\n if i%2:\n v *= 2\n if v > 9: v -= 9\n total += v\n return total%10 == 0\n", "edit-distance-b0-s24": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b1-s24": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b2-s24": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "edit-distance-b3-s24": "def solve(a,b):\n row = list(range(len(b)+1))\n for i,x in enumerate(a,1):\n nxt = [i]\n for j,y in enumerate(b,1):\n nxt.append(min(nxt[-1]+1,row[j]+1,row[j-1]+(x != y)))\n row = nxt\n return row[-1]\n", "meeting-rooms-b0-s24": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b1-s24": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b2-s24": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "meeting-rooms-b3-s24": "def solve(intervals):\n events = []\n for a,b in intervals:\n events.append([a,1])\n events.append([b,-1])\n active = best = 0\n for t,d in sorted(events):\n active += d\n best = max(best,active)\n return best\n", "nearest-percentile-b0-s24": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b1-s24": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b2-s24": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "nearest-percentile-b3-s24": "def solve(values,p):\n if not values: return None\n rank = max(1,(p*len(values)+99)//100)\n return sorted(values)[rank-1]\n", "fifo-inventory-b0-s24": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b1-s24": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b2-s24": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "fifo-inventory-b3-s24": "def solve(lots,demand):\n if sum(q for q,p in lots) < demand: return None\n remaining = []\n cost = 0\n for q,p in lots:\n used = min(q,demand)\n demand -= used\n cost += used*p\n if q-used: remaining.append([q-used,p])\n return [cost,remaining]\n", "csv-row-b0-s24": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b1-s24": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b2-s24": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "csv-row-b3-s24": "def solve(row):\n if not row: return []\n out = []\n field = ''\n quoted = False\n i = 0\n while i < len(row):\n c = row[i]\n if c == '\"':\n if quoted and i+1 < len(row) and row[i+1] == '\"':\n field += '\"'\n i += 1\n else: quoted = not quoted\n elif c == ',' and not quoted:\n out.append(field)\n field = ''\n else: field += c\n i += 1\n out.append(field)\n return out\n", "shortest-path-b0-s24": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b1-s24": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b2-s24": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n", "shortest-path-b3-s24": "def solve(graph,start,target):\n dist = {start:0}\n visited = set()\n while True:\n candidates = [n for n in dist if n not in visited]\n if not candidates: return None\n n = min(candidates,key=lambda x:dist[x])\n if n == target: return dist[n]\n visited.add(n)\n for nxt,w in graph.get(n,[]):\n d = dist[n]+w\n if nxt not in dist or d < dist[nxt]: dist[nxt] = d\n" }