submissionId stringlengths 25 25 | title stringlengths 17 17 | payload dict |
|---|---|---|
cmsvq95rh02p6g4p2z6fxe4sb | Submission FXE4SB | {
"code": "\ndef topological_sort(n, edges):\n from collections import deque\n indeg = [0] * n\n graph = [[] for _ in range(n)]\n for u, v in edges:\n graph[u].append(v)\n indeg[v] += 1\n q = deque([i for i in range(n) if indeg[i] == 0])\n order = []\n while q:\n u = q.poplef... |
cmsvq95rh02p7g4p2s3op3ytr | Submission OP3YTR | {
"code": "\ndef dijkstra(n, edges, src):\n import heapq\n graph = [[] for _ in range(n)]\n for u, v, w in edges:\n graph[u].append((v, w))\n graph[v].append((u, w))\n dist = [float('inf')] * n\n dist[src] = 0\n pq = [(0, src)]\n while pq:\n d, u = heapq.heappop(pq)\n ... |
cmsvq95rh02p8g4p2bocpvrmq | Submission CPVRMQ | {
"code": "\ndef reservoir_sample_deterministic(stream, k, rand_sequence):\n reservoir = stream[:k]\n for i in range(k, len(stream)):\n j = rand_sequence[i - k] % (i + 1)\n if j < k:\n reservoir[j] = stream[i]\n return reservoir\n",
"input": "reservoir_sample_deterministic([10,20,3... |
cmsvq95ri02p9g4p253t1w1nv | Submission T1W1NV | {
"code": "\ndef majority_element(nums):\n count = 0\n candidate = None\n for n in nums:\n if count == 0:\n candidate = n\n count += 1 if n == candidate else -1\n return candidate\n",
"input": "majority_element([2,2,1,1,1,2,2])",
"language": "Python",
"predicted_output": "2"... |
cmsvq95ri02pag4p2mbvq3fro | Submission VQ3FRO | {
"code": "\ndef max_subarray_with_indices(nums):\n best_sum = nums[0]\n cur_sum = nums[0]\n best_start = best_end = cur_start = 0\n for i in range(1, len(nums)):\n if cur_sum < 0:\n cur_sum = nums[i]\n cur_start = i\n else:\n cur_sum += nums[i]\n if c... |
cmsvq95ri02pbg4p2uffku3ir | Submission FKU3IR | {
"code": "\ndef sieve_of_sundaram(limit):\n if limit < 2:\n return []\n n = (limit - 1) // 2\n marked = [False] * (n + 1)\n for i in range(1, n + 1):\n j = i\n while i + j + 2 * i * j <= n:\n marked[i + j + 2 * i * j] = True\n j += 1\n primes = [2] if limit >... |
cmsvq95ri02pcg4p2hq4d1qkx | Submission 4D1QKX | {
"code": "\ndef extended_gcd(a, b):\n if b == 0:\n return (a, 1, 0)\n g, x1, y1 = extended_gcd(b, a % b)\n x = y1\n y = x1 - (a // b) * y1\n return (g, x, y)\n",
"input": "extended_gcd(240, 46)",
"language": "Python",
"predicted_output": "(2, -9, 47)"
} |
cmsvq95ri02pdg4p2y3lg3s2l | Submission LG3S2L | {
"code": "\ndef mod_pow(base, exp, mod):\n result = 1\n base = base % mod\n while exp > 0:\n if exp % 2 == 1:\n result = (result * base) % mod\n exp //= 2\n base = (base * base) % mod\n return result\n",
"input": "mod_pow(4, 13, 497)",
"language": "Python",
"predicte... |
cmsvq95ri02peg4p2ehj5dmd5 | Submission J5DMD5 | {
"code": "\ndef miller_rabin(n):\n if n < 2:\n return False\n for p in [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]:\n if n % p == 0:\n return n == p\n d = n - 1\n r = 0\n while d % 2 == 0:\n d //= 2\n r += 1\n for a in [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31,... |
cmsvq95ri02pfg4p2topd80c2 | Submission PD80C2 | {
"code": "\ndef morse_encode(text):\n MORSE = {\n \"A\": \".-\", \"B\": \"-...\", \"C\": \"-.-.\", \"D\": \"-..\", \"E\": \".\",\n \"F\": \"..-.\", \"G\": \"--.\", \"H\": \"....\", \"I\": \"..\", \"J\": \".---\",\n \"K\": \"-.-\", \"L\": \".-..\", \"M\": \"--\", \"N\": \"-.\", \"O\": \"---\",... |
cmsvq95ri02pgg4p2mttzsxd9 | Submission TZSXD9 | {
"code": "\ndef bresenham_line(x0, y0, x1, y1):\n points = []\n dx = abs(x1 - x0)\n dy = abs(y1 - y0)\n sx = 1 if x0 < x1 else -1\n sy = 1 if y0 < y1 else -1\n err = dx - dy\n while True:\n points.append((x0, y0))\n if x0 == x1 and y0 == y1:\n break\n e2 = 2 * err... |
cmsvq95ri02phg4p2m21hhxsp | Submission 1HHXSP | {
"code": "\nimport heapq\n\ndef huffman_code_lengths(freqs):\n heap = [[f, i, [ch]] for i, (ch, f) in enumerate(freqs.items())]\n heapq.heapify(heap)\n lengths = {ch: 0 for ch in freqs}\n counter = len(heap)\n while len(heap) > 1:\n f1, _, chars1 = heapq.heappop(heap)\n f2, _, chars2 = h... |
cmsvq95ri02pig4p2bc7os007 | Submission 7OS007 | {
"code": "\ndef rabin_karp_search(text, pattern):\n n, m = len(text), len(pattern)\n if m > n:\n return -1\n base, mod = 256, 1000000007\n h = pow(base, m - 1, mod)\n p_hash = t_hash = 0\n for i in range(m):\n p_hash = (p_hash * base + ord(pattern[i])) % mod\n t_hash = (t_hash ... |
cmsvq95ri02pjg4p28mlbt92o | Submission LBT92O | {
"code": "\nimport datetime\n\ndef iso_week_date(year, month, day):\n d = datetime.date(year, month, day)\n iso_year, iso_week, iso_weekday = d.isocalendar()\n return (iso_year, iso_week, iso_weekday)\n",
"input": "iso_week_date(2027, 1, 1)",
"language": "Python",
"predicted_output": "(2026, 53, 5)"
} |
cmsvqtegb02scg4p2ga6e0cpi | Submission 6E0CPI | {
"code": "\ndef kaprekar_steps(n):\n steps = 0\n seen = n\n while seen != 6174 and steps < 100:\n digits = f\"{seen:04d}\"\n asc = int(\"\".join(sorted(digits)))\n desc = int(\"\".join(sorted(digits, reverse=True)))\n seen = desc - asc\n steps += 1\n return steps\n",
... |
cmsvte58z0000uvp2ph62id6s | Submission 62ID6S | {
"code": "def running_median(values):\n import bisect\n sorted_vals = []\n medians = []\n for v in values:\n bisect.insort(sorted_vals, v)\n n = len(sorted_vals)\n if n % 2 == 1:\n medians.append(sorted_vals[n // 2])\n else:\n medians.append((sorted_vals[... |
cmsvte58z0001uvp2iibbmckr | Submission BBMCKR | {
"code": "def flatten_nested(items, depth=0):\n result = []\n for item in items:\n if isinstance(item, list) and depth < 2:\n result.extend(flatten_nested(item, depth + 1))\n else:\n result.append(item)\n return result",
"input": "flatten_nested([1, [2, 3, [4, [5, 6]]],... |
cmsvte58z0002uvp26r4dy0fl | Submission 4DY0FL | {
"code": "class CircularBuffer:\n def __init__(self, size):\n self.size = size\n self.buf = []\n def push(self, val):\n self.buf.append(val)\n if len(self.buf) > self.size:\n self.buf.pop(0)\n def snapshot(self):\n return list(self.buf)\n\ndef drive(vals, size):... |
cmsvte58z0003uvp2ra8h9zw3 | Submission 8H9ZW3 | {
"code": "def safe_divide_chain(nums):\n results = []\n acc = nums[0]\n for n in nums[1:]:\n try:\n acc = acc / n\n except ZeroDivisionError:\n results.append('div0')\n acc = 0\n continue\n results.append(round(acc, 3))\n return results",
... |
cmsvte58z0004uvp2iice54pt | Submission CE54PT | {
"code": "def word_frequency_rank(text):\n from collections import Counter\n words = text.lower().split()\n counts = Counter(words)\n ranked = sorted(counts.items(), key=lambda kv: (-kv[1], kv[0]))\n return ranked[:3]",
"input": "word_frequency_rank('the cat sat on the mat the cat ran')",
"languag... |
cmsvte58z0005uvp2bsdt7tiu | Submission DT7TIU | {
"code": "def matrix_transpose_sum(matrix):\n rows = len(matrix)\n cols = len(matrix[0])\n transposed = [[matrix[r][c] for r in range(rows)] for c in range(cols)]\n row_sums = [sum(row) for row in transposed]\n return transposed, row_sums",
"input": "matrix_transpose_sum([[1,2,3],[4,5,6]])",
"lang... |
cmsvte58z0006uvp259dhxku9 | Submission DHXKU9 | {
"code": "def retry_with_backoff(attempts, fail_until):\n log = []\n for i in range(1, attempts + 1):\n if i < fail_until:\n log.append(f'attempt {i}: failed')\n else:\n log.append(f'attempt {i}: success')\n break\n else:\n log.append('exhausted')\n r... |
cmsvte58z0007uvp2zj525tkh | Submission 525TKH | {
"code": "def dedupe_preserve_order(items):\n seen = set()\n out = []\n for item in items:\n key = item if isinstance(item, (int, str)) else tuple(item)\n if key not in seen:\n seen.add(key)\n out.append(item)\n return out",
"input": "dedupe_preserve_order([1, 2, 2, ... |
cmsvte58z0008uvp2t64v3orx | Submission 4V3ORX | {
"code": "class Graph:\n def __init__(self):\n self.adj = {}\n def add_edge(self, a, b):\n self.adj.setdefault(a, []).append(b)\n self.adj.setdefault(b, []).append(a)\n def bfs(self, start):\n visited = [start]\n queue = [start]\n while queue:\n node = qu... |
cmsvte58z0009uvp2o0qoxh1y | Submission QOXH1Y | {
"code": "def parse_csv_row_types(row):\n result = []\n for cell in row.split(','):\n cell = cell.strip()\n try:\n result.append(int(cell))\n except ValueError:\n try:\n result.append(float(cell))\n except ValueError:\n if cell... |
cmsvte58z000auvp2ytl3q4vb | Submission L3Q4VB | {
"code": "def sliding_window_max(nums, k):\n from collections import deque\n dq = deque()\n result = []\n for i, n in enumerate(nums):\n while dq and nums[dq[-1]] <= n:\n dq.pop()\n dq.append(i)\n if dq[0] <= i - k:\n dq.popleft()\n if i >= k - 1:\n ... |
cmsvte58z000buvp2dxwtcafd | Submission WTCAFD | {
"code": "def merge_intervals(intervals):\n intervals = sorted(intervals, key=lambda x: x[0])\n merged = [intervals[0]]\n for start, end in intervals[1:]:\n last = merged[-1]\n if start <= last[1]:\n merged[-1] = (last[0], max(last[1], end))\n else:\n merged.append... |
cmsvte58z000cuvp2vwvnlsez | Submission VNLSEZ | {
"code": "def exception_chain(vals):\n out = []\n for v in vals:\n try:\n if v < 0:\n raise ValueError('negative')\n if v == 0:\n raise ZeroDivisionError('zero')\n out.append(100 / v)\n except (ValueError, ZeroDivisionError) as e:\n ... |
cmsvte58z000duvp27buqyehf | Submission UQYEHF | {
"code": "def state_machine(events):\n state = 'idle'\n transitions = {\n ('idle', 'start'): 'running',\n ('running', 'pause'): 'paused',\n ('paused', 'resume'): 'running',\n ('running', 'stop'): 'idle',\n ('paused', 'stop'): 'idle',\n }\n history = [state]\n for e i... |
cmsvte58z000euvp24fpfsuuc | Submission PFSUUC | {
"code": "def group_anagrams(words):\n groups = {}\n for w in words:\n key = ''.join(sorted(w))\n groups.setdefault(key, []).append(w)\n return sorted(groups.values(), key=lambda g: (-len(g), g[0]))",
"input": "group_anagrams(['eat','tea','tan','ate','nat','bat'])",
"language": "Python",
... |
cmsvte58z000fuvp2gd1yzt3n | Submission 1YZT3N | {
"code": "def lru_cache_sim(capacity, ops):\n from collections import OrderedDict\n cache = OrderedDict()\n results = []\n for op in ops:\n if op[0] == 'put':\n k, v = op[1], op[2]\n if k in cache:\n cache.move_to_end(k)\n cache[k] = v\n i... |
cmsvte58z000guvp224esun4x | Submission ESUN4X | {
"code": "def bit_manipulation_stats(n):\n binary = bin(n)[2:]\n ones = binary.count('1')\n zeros = binary.count('0')\n reversed_val = int(binary[::-1], 2)\n return {'binary': binary, 'ones': ones, 'zeros': zeros, 'reversed': reversed_val}",
"input": "bit_manipulation_stats(43)",
"language": "Pyth... |
cmsvte58z000huvp289ttatv2 | Submission TTATV2 | {
"code": "def recursive_fib_memo(n, memo=None):\n if memo is None:\n memo = {}\n if n in memo:\n return memo[n]\n if n <= 1:\n return n\n memo[n] = recursive_fib_memo(n-1, memo) + recursive_fib_memo(n-2, memo)\n return memo[n]\n\ndef fib_sequence(n):\n return [recursive_fib_mem... |
cmsvte58z000iuvp2w0l3s15j | Submission L3S15J | {
"code": "def validate_and_normalize_paths(paths):\n import posixpath\n normalized = []\n for p in paths:\n try:\n norm = posixpath.normpath(p)\n if norm.startswith('..'):\n raise ValueError('escapes root')\n normalized.append(norm)\n except Valu... |
cmsvte58z000juvp2dcqkmrgw | Submission QKMRGW | {
"code": "def custom_sort_with_key_errors(records):\n def key_fn(r):\n try:\n return (-r['priority'], r['name'])\n except KeyError:\n return (0, '')\n valid = [r for r in records if 'priority' in r and 'name' in r]\n return sorted(valid, key=key_fn)",
"input": "custom_s... |
cmsw2qs96003huvp2g020j92y | Submission 20J92Y | {
"code": "class LazyTag:\n def __init__(self, label):\n self.label = label\n\n def __get__(self, obj, owner=None):\n if obj is None:\n return \"class-access\"\n return (\"nondata\", self.label)\n\n\nclass Doubling:\n def __set_name__(self, owner, name):\n self.slot = n... |
cmsw2qs96003iuvp2xlo3s736 | Submission O3S736 | {
"code": "EVENTS = []\n\n\nclass Marker:\n def __set_name__(self, owner, name):\n EVENTS.append((\"set_name\", owner.__name__, name))\n\n\nclass Base:\n def __init_subclass__(cls, tag=\"none\", **kwargs):\n super().__init_subclass__(**kwargs)\n EVENTS.append((\"init_subclass\", cls.__name_... |
cmsw2qs96003juvp2rmjt85pf | Submission JT85PF | {
"code": "def inner():\n try:\n received = yield \"a\"\n yield (\"echo\", received)\n except ValueError as exc:\n yield (\"caught\", exc.args[0])\n return \"fin\"\n\n\ndef outer(log):\n delivered = yield from inner()\n log.append(delivered)\n yield \"tail\"\n\n\ndef delegate_ru... |
cmsw2qs96003kuvp2ncb5d6qj | Submission B5D6QJ | {
"code": "class Fallback(dict):\n def __init__(self, *args, **kwargs):\n super().__init__(*args, **kwargs)\n self.misses = []\n\n def __missing__(self, key):\n self.misses.append(key)\n value = \"gen-\" + key\n self[key] = value\n return value\n\n\ndef missing_run():\n... |
cmsw2qs96003luvp2esnnw0rg | Submission NNW0RG | {
"code": "class Temp:\n def __init__(self, celsius):\n self.celsius = celsius\n\n def __format__(self, spec):\n if spec.endswith(\"F\"):\n return format(self.celsius * 9 / 5 + 32, spec[:-1]) + \"F\"\n if not spec:\n return \"T(\" + str(self.celsius) + \")\"\n r... |
cmsw2qs96003muvp2bkj6f8gf | Submission J6F8GF | {
"code": "from collections import ChainMap\n\n\ndef layered_config():\n defaults = {\"color\": \"red\", \"size\": \"M\", \"qty\": 1}\n session = {\"size\": \"L\"}\n cm = ChainMap(session, defaults)\n a = (cm[\"size\"], cm[\"color\"], len(cm))\n cm[\"color\"] = \"blue\"\n b = (defaults[\"color\"], s... |
cmsw2qs96003nuvp2c8tfi5xl | Submission TFI5XL | {
"code": "from collections import deque\n\n\ndef ring_buffer_run():\n d = deque([1, 2, 3], maxlen=4)\n d.append(4)\n d.append(5)\n a = list(d)\n d.appendleft(0)\n b = list(d)\n d.rotate(-1)\n c = list(d)\n\n e = deque(maxlen=3)\n e.extendleft([1, 2, 3, 4])\n f = list(e)\n\n g = de... |
cmsw2qs96003ouvp2jib841qb | Submission B841QB | {
"code": "def buffer_share():\n buf = bytearray(b\"abcdef\")\n mv = memoryview(buf)\n a = (mv[0], bytes(mv[1:3]), mv.nbytes, mv.readonly)\n mv[2:4] = b\"ZZ\"\n b = bytes(buf)\n\n rows = memoryview(bytes(range(6))).cast(\"B\", shape=(2, 3))\n c = (rows.shape, rows.ndim, rows.tolist(), rows.tolist... |
cmsw2qs96003puvp2tbwd45mb | Submission WD45MB | {
"code": "class Point:\n __match_args__ = (\"x\", \"y\")\n\n def __init__(self, x, y):\n self.x = x\n self.y = y\n\n\ndef classify(value):\n match value:\n case Point(0, 0):\n return \"origin\"\n case Point(x, 0) | Point(0, x):\n return (\"axis\", x)\n ... |
cmsw2qs96003quvp2bh55cis9 | Submission 55CIS9 | {
"code": "def make_lambdas(values):\n plain = [lambda: v for v in values]\n bound = [lambda v=v: v for v in values]\n return plain, bound\n\n\ndef binding_run():\n plain, bound = make_lambdas([1, 2, 3])\n a = [f() for f in plain]\n b = [f() for f in bound]\n\n data = [1, 2, 3]\n gen = (x * 10... |
cmsw2qs96003ruvp2gigql761 | Submission GQL761 | {
"code": "def case_map_run():\n s = \"straße\"\n a = (s.upper(), len(s), len(s.upper()))\n b = (\"ß\".casefold(), \"ß\".upper().casefold(),\n \"ß\".casefold() == \"SS\".casefold())\n c = (\"İ\".lower(), len(\"İ\".lower()))\n d = (\"Dž\".title(), \"Dž\".upper(), \"Dž\".lower(), \"Dž\".capitalize())... |
cmsw2qs96003suvp2cfhsp54b | Submission HSP54B | {
"code": "import unicodedata\n\n\ndef normalize_run():\n nfc = chr(0x00E9)\n nfd = \"e\" + chr(0x0301)\n a = (len(nfc), len(nfd), nfc == nfd,\n unicodedata.normalize(\"NFC\", nfd) == nfc)\n b = (unicodedata.name(nfd[1]), unicodedata.combining(nfd[1]))\n c = ([hex(ord(ch)) for ch in unicodedata... |
cmsw2qs96003tuvp2rcaieoy1 | Submission AIEOY1 | {
"code": "def view_algebra():\n d = {\"a\": 1, \"b\": 2, \"c\": 3}\n keys = d.keys()\n items = d.items()\n values = d.values()\n\n a = (sorted(keys & {\"b\", \"c\", \"z\"}), sorted(keys - {\"a\"}),\n sorted(keys ^ {\"a\", \"z\"}))\n d[\"e\"] = 5\n b = (sorted(keys), len(items))\n c = ... |
cmsw2qs96003uuvp2ge4813c2 | Submission 4813C2 | {
"code": "def slice_surgery():\n a = list(range(8))\n a[::2] = [\"x\"] * 4\n r1 = list(a)\n try:\n a[::2] = [\"y\"] * 3\n r2 = \"ok\"\n except ValueError:\n r2 = \"ValueError\"\n\n b = list(range(6))\n b[1:4] = [\"p\"]\n r3 = list(b)\n\n c = list(range(8))\n del c[:... |
cmsw2qs96003vuvp27kijhswy | Submission IJHSWY | {
"code": "import itertools\n\n\ndef stream_consume():\n src = iter(range(10))\n a = list(itertools.islice(src, 3))\n b = next(src)\n c = list(itertools.islice(src, 0, 4, 2))\n d = next(src)\n\n x, y = itertools.tee(iter(\"abcd\"))\n e = (next(x), next(x), \"\".join(y), \"\".join(x))\n\n count... |
cmsw2qs96003wuvp29r7hjgco | Submission 7HJGCO | {
"code": "def codec_run():\n s = \"café ☃\"\n a = (s.encode(\"ascii\", \"replace\"), s.encode(\"ascii\", \"ignore\"),\n s.encode(\"ascii\", \"backslashreplace\"))\n b = s.encode(\"ascii\", \"xmlcharrefreplace\")\n c = s.encode(\"latin-1\", \"backslashreplace\")\n\n raw = b\"valid \\xff\\xfe ta... |
cmsw2qs96003xuvp20mkxm78q | Submission KXM78Q | {
"code": "import functools\nfrom collections import OrderedDict\n\n\n@functools.singledispatch\ndef describe(value):\n return (\"generic\", type(value).__name__)\n\n\n@describe.register\ndef _(value: int):\n return (\"int\", value)\n\n\n@describe.register(bool)\ndef _(value):\n return (\"bool\", value)\n\n\... |
cmsw2qs96003yuvp2v8et66so | Submission ET66SO | {
"code": "def sentinel_iter():\n seq = [3, 1, 4, 1, 5, 9]\n it = iter(seq)\n a = list(iter(lambda: next(it, None), None))\n\n counter = {\"n\": 0}\n\n def tick():\n counter[\"n\"] += 1\n return counter[\"n\"] * counter[\"n\"]\n\n b = list(iter(tick, 16))\n c = counter[\"n\"]\n d... |
cmsw2qs96003zuvp2a3f9tpfv | Submission F9TPFV | {
"code": "def zip_drain():\n it = iter(range(7))\n a = list(zip(it, it, it))\n b = list(it)\n\n it2 = iter(\"abcdef\")\n pairs = list(zip(it2, it2))\n c = (pairs, list(it2))\n\n short = iter([1, 2, 3])\n other = iter([\"a\", \"b\"])\n d = list(zip(short, other))\n e = list(short)\n\n ... |
cmsw2qs960040uvp25ryyx656 | Submission YYX656 | {
"code": "import copy\n\n\ndef cyclic_repr():\n a = [1, 2]\n a.append(a)\n r1 = repr(a)\n\n d = {\"k\": 1}\n d[\"self\"] = d\n r2 = repr(d)\n\n r3 = (a[2] is a, len(a))\n\n c = copy.deepcopy(a)\n r4 = (c is not a, c[2] is c, repr(c))\n\n t = ([1],)\n t[0].append(t)\n r5 = repr(t)\... |
cmswrsvaa007kuvp2tkyqv3nl | Submission YQV3NL | {
"code": "from itertools import groupby\ndef group_lengths(words):\n words = sorted(words, key=len)\n return {length: list(group) for length, group in groupby(words, key=len)}",
"input": "group_lengths(['a', 'bb', 'cc', 'ddd', 'e', 'ff'])",
"language": "Python",
"predicted_output": "{1: ['a', 'e'], 2: ['... |
cmswrta8f007luvp2eco0fl0y | Submission O0FL0Y | {
"code": "from itertools import permutations\ndef unique_arrangements(s):\n return sorted(set(''.join(p) for p in permutations(s)))",
"input": "unique_arrangements('aab')",
"language": "Python",
"predicted_output": "['aab', 'aba', 'baa']"
} |
cmswrta8f007nuvp2c4j3sdeg | Submission J3SDEG | {
"code": "import operator\ndef apply_ops(a, b, ops):\n table = {'+': operator.add, '-': operator.sub, '*': operator.mul, '/': operator.truediv}\n return [table[op](a, b) for op in ops]",
"input": "apply_ops(10, 4, ['+', '-', '*', '/'])",
"language": "Python",
"predicted_output": "[14, 6, 40, 2.5]"
} |
cmswrta8f007ouvp2ouorxbh5 | Submission ORXBH5 | {
"code": "from dataclasses import dataclass, field\n\n@dataclass(order=True)\nclass Point:\n x: int\n y: int\n\n def manhattan(self):\n return abs(self.x) + abs(self.y)\n\ndef farthest(points):\n return max(points, key=lambda p: p.manhattan())",
"input": "farthest([Point(1, 2), Point(-3, 1), Poi... |
cmswrta8f007puvp2fmvj1luy | Submission VJ1LUY | {
"code": "from enum import Enum, auto\n\nclass Direction(Enum):\n NORTH = auto()\n EAST = auto()\n SOUTH = auto()\n WEST = auto()\n\ndef turn_right(d):\n order = [Direction.NORTH, Direction.EAST, Direction.SOUTH, Direction.WEST]\n idx = order.index(d)\n return order[(idx + 1) % 4]",
"input": "... |
cmswrtj5p007ruvp21yxefhfo | Submission XEFHFO | {
"code": "import textwrap\ndef wrap_and_count(text, width):\n lines = textwrap.wrap(text, width=width)\n return (len(lines), lines)",
"input": "wrap_and_count('the quick brown fox jumps over the lazy dog', 12)",
"language": "Python",
"predicted_output": "(4, ['the quick', 'brown fox', 'jumps over', 'the ... |
cmswrtj5p007suvp2jk990d3h | Submission 990D3H | {
"code": "from decimal import Decimal, ROUND_HALF_UP\ndef price_with_tax(price_str, rate_str):\n price = Decimal(price_str)\n rate = Decimal(rate_str)\n total = price * (1 + rate)\n return str(total.quantize(Decimal('0.01'), rounding=ROUND_HALF_UP))",
"input": "price_with_tax('19.99', '0.0825')",
"la... |
cmswrtj5p007tuvp20r884nfq | Submission 884NFQ | {
"code": "from fractions import Fraction\ndef sum_fractions(pairs):\n total = Fraction(0)\n for num, den in pairs:\n total += Fraction(num, den)\n return total",
"input": "sum_fractions([(1, 3), (1, 6), (1, 2)])",
"language": "Python",
"predicted_output": "1"
} |
cmswrtj5p007uuvp2dwtmyclc | Submission TMYCLC | {
"code": "class Resource:\n def __init__(self, name):\n self.name = name\n self.log = []\n\n def __enter__(self):\n self.log.append(f\"open {self.name}\")\n return self\n\n def __exit__(self, exc_type, exc_val, exc_tb):\n self.log.append(f\"close {self.name}\")\n re... |
cmswrtqid007vuvp2rj1h11os | Submission 1H11OS | {
"code": "class Circle:\n def __init__(self, radius):\n self._radius = radius\n\n @property\n def radius(self):\n return self._radius\n\n @radius.setter\n def radius(self, value):\n if value < 0:\n raise ValueError(\"radius must be non-negative\")\n self._radius ... |
cmswrtqie007wuvp2lr0dkgcx | Submission 0DKGCX | {
"code": "class A:\n def greet(self):\n return \"A\"\n\nclass B(A):\n def greet(self):\n return \"B->\" + super().greet()\n\nclass C(A):\n def greet(self):\n return \"C->\" + super().greet()\n\nclass D(B, C):\n def greet(self):\n return \"D->\" + super().greet()\n\ndef mro_gre... |
cmswrtqie007xuvp2eyji5guc | Submission JI5GUC | {
"code": "from itertools import filterfalse\n\ndef partition_by_predicate(nums, pred):\n matches = list(filter(pred, nums))\n non_matches = list(filterfalse(pred, nums))\n return (matches, non_matches)",
"input": "partition_by_predicate([1, 2, 3, 4, 5, 6, 7, 8], lambda n: n % 3 == 0)",
"language": "Pyth... |
cmswrtqie007yuvp24oj7ep6a | Submission J7EP6A | {
"code": "def first_and_rest(items):\n first, *rest = items\n *init, last = rest\n return (first, init, last)",
"input": "first_and_rest([10, 20, 30, 40, 50])",
"language": "Python",
"predicted_output": "(10, [20, 30, 40], 50)"
} |
cmswrtqie007zuvp2390lz77p | Submission 0LZ77P | {
"code": "def make_multipliers():\n return [lambda x, i=i: x * i for i in range(4)]\n\ndef apply_all(x):\n fns = make_multipliers()\n return [f(x) for f in fns]",
"input": "apply_all(3)",
"language": "Python",
"predicted_output": "[0, 3, 6, 9]"
} |
cmswrtvsk0081uvp27q6b7rnj | Submission 6B7RNJ | {
"code": "from functools import lru_cache\n\n@lru_cache(maxsize=None)\ndef digit_sum(n):\n if n < 10:\n return n\n return n % 10 + digit_sum(n // 10)\n\n@lru_cache(maxsize=None)\ndef repeated_digit_sum(n):\n while n >= 10:\n n = digit_sum(n)\n return n",
"input": "repeated_digit_sum(9875)... |
cmswru6ev0084uvp2f34u6age | Submission 4U6AGE | {
"code": "def all_ascending(nums):\n return all(a < b for a, b in zip(nums, nums[1:]))\n\ndef any_negative(nums):\n return any(n < 0 for n in nums)\n\ndef check_list(nums):\n return (all_ascending(nums), any_negative(nums))",
"input": "check_list([1, 3, 5, 4, -2])",
"language": "Python",
"predicted_ou... |
cmswruw3r0086uvp2xxkurg56 | Submission KURG56 | {
"code": "import random\ndef deterministic_shuffle(items, seed):\n rng = random.Random(seed)\n items = list(items)\n rng.shuffle(items)\n return items",
"input": "deterministic_shuffle([1, 2, 3, 4, 5], 42)",
"language": "Python",
"predicted_output": "[4, 2, 3, 5, 1]"
} |
cmswzw85l00ctuvp2jwiq4hvp | Submission IQ4HVP | {
"code": "def accumulate(pairs, store={}):\n for key, value in pairs:\n store.setdefault(key, []).append(value)\n return dict(store)",
"input": "(accumulate([('a', 1), ('b', 2)]), accumulate([('a', 3)]))",
"language": "Python",
"predicted_output": "({'a': [1, 3], 'b': [2]}, {'a': [1, 3], 'b': [2]}... |
cmswzw85l00cuuvp2deb6mh6t | Submission B6MH6T | {
"code": "def normalize_ports(tokens):\n ports = []\n for token in tokens:\n try:\n ports.append(int(token))\n except ValueError:\n ports.append(-1)\n else:\n if ports[-1] > 1024:\n ports[-1] = 1024\n finally:\n if ports[-1]... |
cmswzw85l00cvuvp2t7q436b8 | Submission Q436B8 | {
"code": "from itertools import groupby\n\ndef collapse_runs(records):\n summary = []\n for level, group in groupby(records, key=lambda record: record['level']):\n summary.append((level, sum(1 for _ in group)))\n return summary",
"input": "collapse_runs([{'level': 'INFO'}, {'level': 'INFO'}, {'leve... |
cmswzw85l00cwuvp2o78uxhev | Submission 8UXHEV | {
"code": "from datetime import datetime, timedelta\n\ndef window_labels(start, count, minutes):\n base = datetime.strptime(start, '%Y-%m-%d %H:%M')\n return [(base + timedelta(minutes=minutes * step)).strftime('%d/%H:%M') for step in range(count)]",
"input": "window_labels('2026-02-28 23:20', 4, 25)",
"lan... |
cmswzw85l00cxuvp2gfqke4xn | Submission QKE4XN | {
"code": "def competition_ranks(scores):\n ordered = sorted(scores.items(), key=lambda pair: (-pair[1], pair[0]))\n ranks = {}\n previous_score = None\n current_rank = 0\n for position, (name, score) in enumerate(ordered, start=1):\n if score != previous_score:\n current_rank = posit... |
cmsx35cwm0000x3p25q4cap3o | Submission 4CAP3O | {
"code": "class SkipMultiples:\n def __init__(self, limit, n):\n self.limit = limit\n self.n = n\n self.current = 0\n def __iter__(self):\n return self\n def __next__(self):\n while self.current < self.limit:\n self.current += 1\n if self.current % se... |
cmsx35cwm0002x3p2xv9ydh3o | Submission 9YDH3O | {
"code": "class Shape:\n def area(self):\n raise NotImplementedError\n\nclass Rectangle(Shape):\n def __init__(self, w, h):\n self.w = w\n self.h = h\n def area(self):\n return self.w * self.h\n\nclass Circle(Shape):\n def __init__(self, r):\n self.r = r\n def area(s... |
cmsx35cwm0004x3p2se7oe3wm | Submission 7OE3WM | {
"code": "from functools import reduce\n\ndef running_max_index(nums):\n def combine(acc, pair):\n idx, val = pair\n best_idx, best_val, results = acc\n if val > best_val:\n best_idx, best_val = idx, val\n results = results + [(best_idx, best_val)]\n return best_idx, ... |
cmsx35cwm0006x3p2rst9h4qv | Submission T9H4QV | {
"code": "class Version:\n def __init__(self, major, minor, patch):\n self.major = major\n self.minor = minor\n self.patch = patch\n def __eq__(self, other):\n return (self.major, self.minor, self.patch) == (other.major, other.minor, other.patch)\n def __lt__(self, other):\n ... |
cmsx35cwn0007x3p2jusawql0 | Submission SAWQL0 | {
"code": "def safe_divider(pairs):\n for a, b in pairs:\n try:\n yield a / b\n except ZeroDivisionError:\n yield None\n\ndef run_divisions(pairs):\n return list(safe_divider(pairs))",
"input": "run_divisions([(10, 2), (5, 0), (9, 3), (1, 0)])",
"language": "Python",
"p... |
cmsx35cwn0008x3p2gbkl82fo | Submission KL82FO | {
"code": "def slice_report(s):\n return {\n 'reverse': s[::-1],\n 'every_other': s[::2],\n 'middle': s[2:-2],\n 'oob_high': s[100:200],\n 'neg_step_range': s[8:2:-1],\n }",
"input": "slice_report('abcdefghij')",
"language": "Python",
"predicted_output": "{'reverse': 'ji... |
cmsx35cwn0009x3p2i1qo2kew | Submission QO2KEW | {
"code": "class Node:\n def __init__(self, value, nxt=None):\n self.value = value\n self.nxt = nxt\n\ndef build_list(values):\n head = None\n for v in reversed(values):\n head = Node(v, head)\n return head\n\ndef reverse_recursive(node, prev=None):\n if node is None:\n retu... |
cmsx36tfl000ax3p2e7c1vsqw | Submission C1VSQW | {
"code": "def make_account(balance):\n history = []\n def deposit(amount):\n nonlocal balance\n balance += amount\n history.append(('deposit', amount, balance))\n return balance\n def withdraw(amount):\n nonlocal balance\n if amount > balance:\n history.a... |
cmsx373zl000cx3p2drgjnea1 | Submission GJNEA1 | {
"code": "def flatten(items):\n result = []\n for item in items:\n if isinstance(item, list):\n result.extend(flatten(item))\n else:\n result.append(item)\n return result",
"input": "flatten([1, [2, 3, [4, [5, 6], 7]], 8, [], [9]])",
"language": "Python",
"predicted... |
cmsx374iy000dx3p2rdut569v | Submission UT569V | {
"code": "def add_item(item, bucket=[]):\n bucket.append(item)\n return bucket\n\ndef run_trap():\n first = add_item(1)\n second = add_item(2)\n third = add_item(3, [])\n return first, second, third, first is second",
"input": "run_trap()",
"language": "Python",
"predicted_output": "([1, 2], ... |
cmsx375kr000gx3p2l779uvhz | Submission 79UVHZ | {
"code": "def memoize(func):\n cache = {}\n calls = [0]\n def wrapper(n):\n calls[0] += 1\n if n not in cache:\n cache[n] = func(n)\n return cache[n]\n wrapper.calls = calls\n return wrapper\n\n@memoize\ndef fib(n):\n if n < 2:\n return n\n return fib(n - 1... |
cmsx38p48000hx3p2z4sklufy | Submission SKLUFY | {
"code": "class InsufficientFundsError(Exception):\n pass\n\ndef process_payment(balance, amount):\n log = []\n try:\n if amount <= 0:\n raise ValueError(\"amount must be positive\")\n if amount > balance:\n raise InsufficientFundsError(f\"need {amount - balance} more\")\... |
cmsx38p48000jx3p2spzz8jpr | Submission ZZ8JPR | {
"code": "class Suppress:\n def __init__(self, exc_type):\n self.exc_type = exc_type\n self.suppressed = False\n def __enter__(self):\n return self\n def __exit__(self, exc_type, exc_val, exc_tb):\n if exc_type is not None and issubclass(exc_type, self.exc_type):\n sel... |
cmsxkh6jg00f7kup2eddnae88 | Submission DNAE88 | {
"code": "def reconcile(events):\n stock = {}\n rejected = []\n for sku, delta in events:\n current = stock.get(sku, 0)\n if current + delta < 0:\n rejected.append((sku, delta, current))\n else:\n stock[sku] = current + delta\n return dict(sorted(stock.items()))... |
cmsxkh6jg00f8kup2qnzeb2j0 | Submission ZEB2J0 | {
"code": "from collections import deque\n\ndef rolling_windows(values, width):\n window = deque()\n total = 0\n result = []\n for value in values:\n window.append(value)\n total += value\n if len(window) > width:\n total -= window.popleft()\n if len(window) == width... |
cmsxkh6jh00f9kup2fdgtsmmt | Submission GTSMMT | {
"code": "def coerce_rows(rows, schema):\n result = []\n errors = []\n for index, row in enumerate(rows):\n clean = {}\n for field, kind in schema.items():\n value = row.get(field)\n try:\n if kind == 'int':\n clean[field] = int(value)\n ... |
cmsxkh6jh00fakup2rs29u4sc | Submission 29U4SC | {
"code": "def allocate(requests, capacities):\n remaining = capacities.copy()\n allocations = []\n for team, resource, amount in requests:\n available = remaining.get(resource, 0)\n granted = min(max(amount, 0), available)\n if granted:\n allocations.append((team, resource, g... |
cmsxkh6jh00fbkup2cqdur2dn | Submission DUR2DN | {
"code": "def retry_summary(jobs, limit):\n summary = {}\n exhausted = []\n for name in sorted(jobs):\n attempts = 0\n succeeded = False\n for outcome in jobs[name][:limit]:\n attempts += 1\n if outcome:\n succeeded = True\n break\n ... |
cmsxkh6jh00fckup23bczfrda | Submission CZFRDA | {
"code": "def trace_aliases(mapping, names):\n result = {}\n for start in names:\n path = []\n node = start\n while node in mapping and node not in path:\n path.append(node)\n node = mapping[node]\n if node in path:\n cycle = path[path.index(node):]\... |
cmsxkh6jh00fdkup2g9iug9xn | Submission IUG9XN | {
"code": "def settle(entries, overdraft_fee=5):\n balances = {}\n alerts = []\n for account, amount in entries:\n before = balances.get(account, 0)\n after = before + amount\n if amount < 0 and after < 0:\n after -= overdraft_fee\n alerts.append((account, before, a... |
cmsxkh6jh00fekup228aurw2t | Submission AURW2T | {
"code": "def compact_bookings(bookings):\n merged = []\n for room, start, end in sorted(bookings):\n if merged and merged[-1][0] == room and start <= merged[-1][2]:\n old_room, old_start, old_end = merged[-1]\n merged[-1] = (old_room, old_start, max(old_end, end))\n else:\n... |
cmsxkh6jh00ffkup2y8txjicf | Submission TXJICF | {
"code": "def session_durations(events):\n active = {}\n durations = {}\n anomalies = []\n for user, minute, action in events:\n if action == 'login':\n if user in active:\n anomalies.append((user, 'duplicate_login', minute))\n else:\n active[use... |
cmsxkh6jh00fgkup2qxick56s | Submission ICK56S | {
"code": "import copy\n\ndef apply_patches(document, patches):\n result = copy.deepcopy(document)\n applied = []\n rejected = []\n for path, value in patches:\n keys = path.split('.')\n current = result\n valid = True\n for key in keys[:-1]:\n if key not in current:... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.