| {"task_id": "code-42-0000", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 7 + 4\n def g(x): return x * x\n\nWhat is the integer value of `g(f(8))`?", "reference_answer": "3600", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 7, "f_b": 4, "x": 8}} |
| {"task_id": "code-42-0001", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the index of the maximum element in `lst` (first occurrence; behavior undefined on empty).\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return lst.index(max(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return lst.index(max(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 3}} |
| {"task_id": "code-42-0002", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 5 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 5 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 5 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 5}} |
| {"task_id": "code-42-0003", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 6 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 6 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 6 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 6}} |
| {"task_id": "code-42-0004", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 5 + 6\n def g(x): return x * x\n\nWhat is the integer value of `g(f(11))`?", "reference_answer": "3721", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 5, "f_b": 6, "x": 11}} |
| {"task_id": "code-42-0005", "family": "code", "difficulty": 0.85, "prompt": "The following Python function has a one-line bug:\n\n```python\ndef h(x):\n return x * x + 14 # BUG: should be x*x - 14\n```\n\nReply with the corrected function (just the def block, in a python code fence). Three calls of the form `h(x)` will be checked.", "reference_answer": "```python\ndef h(x):\n return x * x - 14\n```", "estimated_seconds": 91.5, "metadata": {"generator": "_gen_t6_bugfix", "tier": 0.85, "variant": 0}} |
| {"task_id": "code-42-0006", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the list reversed.\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return list(reversed(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return list(reversed(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 1}} |
| {"task_id": "code-42-0007", "family": "code", "difficulty": 0.85, "prompt": "The following Python function has a one-line bug:\n\n```python\ndef h(x):\n return x * x + 11 # BUG: should be x*x - 11\n```\n\nReply with the corrected function (just the def block, in a python code fence). Three calls of the form `h(x)` will be checked.", "reference_answer": "```python\ndef h(x):\n return x * x - 11\n```", "estimated_seconds": 91.5, "metadata": {"generator": "_gen_t6_bugfix", "tier": 0.85, "variant": 0}} |
| {"task_id": "code-42-0008", "family": "code", "difficulty": 0.975, "prompt": "Count the number of distinct subsets of the following list of non-negative integers whose elements sum to exactly the given target. Two subsets are distinct if their index sets differ (the empty subset counts only if the target is 0). Return a single integer.\n\nList: [7, 11, 4, 10, 14, 11, 7, 5]\nTarget: 40\n\nReturn only the integer count.", "reference_answer": "8", "estimated_seconds": 102.75, "metadata": {"generator": "_gen_text_dp_count", "tier": 0.975, "target": 40, "count": 8}} |
| {"task_id": "code-42-0009", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the list reversed.\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return list(reversed(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return list(reversed(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 1}} |
| {"task_id": "code-42-0010", "family": "code", "difficulty": 0.975, "prompt": "Count the number of distinct subsets of the following list of non-negative integers whose elements sum to exactly the given target. Two subsets are distinct if their index sets differ (the empty subset counts only if the target is 0). Return a single integer.\n\nList: [1, 6, 12, 12, 8, 9, 1, 11, 1]\nTarget: 11\n\nReturn only the integer count.", "reference_answer": "5", "estimated_seconds": 102.75, "metadata": {"generator": "_gen_text_dp_count", "tier": 0.975, "target": 11, "count": 5}} |
| {"task_id": "code-42-0011", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the sum of even numbers in `lst`.\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return sum(x for x in lst if x % 2 == 0)\n```", "reference_answer": "```python\ndef g(lst):\n return sum(x for x in lst if x % 2 == 0)\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 2}} |
| {"task_id": "code-42-0012", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n max(13, 11, 2)", "reference_answer": "13", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "max(13, 11, 2)"}} |
| {"task_id": "code-42-0013", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 2 + 7\n def g(x): return x * x\n\nWhat is the integer value of `g(f(10))`?", "reference_answer": "729", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 2, "f_b": 7, "x": 10}} |
| {"task_id": "code-42-0014", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 12 nodes {0, 1, \u2026, 11} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (1, 2), (1, 3), (1, 6), (1, 9), (2, 3), (2, 7), (3, 4), (3, 5), (3, 8), (4, 5), (4, 6), (5, 6), (5, 10), (6, 7), (6, 8), (7, 8), (7, 9), (8, 9), (8, 10), (8, 11), (9, 10), (10, 11)]\n\nHow many distinct directed paths are there from node 0 to node 11? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "64", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 12, "count": 64}} |
| {"task_id": "code-42-0015", "family": "code", "difficulty": 0.975, "prompt": "Count the number of distinct subsets of the following list of non-negative integers whose elements sum to exactly the given target. Two subsets are distinct if their index sets differ (the empty subset counts only if the target is 0). Return a single integer.\n\nList: [4, 14, 8, 11, 3, 3, 6, 12]\nTarget: 41\n\nReturn only the integer count.", "reference_answer": "6", "estimated_seconds": 102.75, "metadata": {"generator": "_gen_text_dp_count", "tier": 0.975, "target": 41, "count": 6}} |
| {"task_id": "code-42-0016", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(13 + 12)\n\nReturn the printed value (an integer).", "reference_answer": "25", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 13, "b": 12, "op": "+"}} |
| {"task_id": "code-42-0017", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n max(18, 5, 13)", "reference_answer": "18", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "max(18, 5, 13)"}} |
| {"task_id": "code-42-0018", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 6 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 6 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 6 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 6}} |
| {"task_id": "code-42-0019", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 2 + 4\n def g(x): return x * x\n\nWhat is the integer value of `g(f(4))`?", "reference_answer": "144", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 2, "f_b": 4, "x": 4}} |
| {"task_id": "code-42-0020", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 5 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 5 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 5 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 5}} |
| {"task_id": "code-42-0021", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 1 modulo 9. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=24, v=27), (w=1, v=64), (w=15, v=54), (w=16, v=32), (w=27, v=60), (w=5, v=5), (w=8, v=61), (w=27, v=30), (w=8, v=11), (w=16, v=50), (w=15, v=60)\nConstraint: total weight \u2261 1 (mod 9)\n\nReturn only the integer optimal total value.", "reference_answer": "443", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 9, "k": 1, "optimal": 443}} |
| {"task_id": "code-42-0022", "family": "code", "difficulty": 0.85, "prompt": "The following Python function has a one-line bug:\n\n```python\ndef h(x):\n return x * x + 3 # BUG: should be x*x - 3\n```\n\nReply with the corrected function (just the def block, in a python code fence). Three calls of the form `h(x)` will be checked.", "reference_answer": "```python\ndef h(x):\n return x * x - 3\n```", "estimated_seconds": 91.5, "metadata": {"generator": "_gen_t6_bugfix", "tier": 0.85, "variant": 0}} |
| {"task_id": "code-42-0023", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 14 nodes {0, 1, \u2026, 13} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (0, 3), (0, 5), (0, 6), (0, 13), (1, 2), (2, 3), (2, 8), (3, 4), (3, 6), (3, 7), (3, 8), (3, 9), (4, 5), (4, 13), (5, 6), (5, 7), (5, 8), (5, 9), (5, 10), (6, 7), (7, 8), (7, 12), (7, 13), (8, 9), (8, 10), (8, 11), (9, 10), (9, 12), (9, 13), (10, 11), (10, 12), (10, 13), (11, 12), (11, 13), (12, 13)]\n\nHow many distinct directed paths are there from node 0 to node 13? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "271", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 14, "count": 271}} |
| {"task_id": "code-42-0024", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n 14 % 6", "reference_answer": "2", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "14 % 6"}} |
| {"task_id": "code-42-0025", "family": "code", "difficulty": 0.975, "prompt": "Count the number of distinct subsets of the following list of non-negative integers whose elements sum to exactly the given target. Two subsets are distinct if their index sets differ (the empty subset counts only if the target is 0). Return a single integer.\n\nList: [9, 15, 5, 15, 8, 5, 1, 6, 2, 11, 14]\nTarget: 37\n\nReturn only the integer count.", "reference_answer": "47", "estimated_seconds": 102.75, "metadata": {"generator": "_gen_text_dp_count", "tier": 0.975, "target": 37, "count": 47}} |
| {"task_id": "code-42-0026", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 9 modulo 10. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=25, v=19), (w=11, v=3), (w=18, v=31), (w=9, v=19), (w=30, v=7), (w=26, v=44), (w=17, v=64), (w=2, v=31), (w=24, v=24), (w=8, v=7), (w=22, v=52), (w=29, v=30)\nConstraint: total weight \u2261 9 (mod 10)\n\nReturn only the integer optimal total value.", "reference_answer": "300", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 10, "k": 9, "optimal": 300}} |
| {"task_id": "code-42-0027", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n len('xxxxxxxxxxx')", "reference_answer": "11", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "len('xxxxxxxxxxx')"}} |
| {"task_id": "code-42-0028", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 15 nodes {0, 1, \u2026, 14} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (0, 13), (1, 2), (1, 9), (2, 3), (2, 6), (2, 9), (2, 11), (3, 4), (3, 8), (3, 13), (4, 5), (5, 6), (5, 10), (5, 12), (6, 7), (6, 8), (6, 9), (6, 10), (6, 12), (7, 8), (7, 9), (8, 9), (8, 10), (8, 11), (8, 13), (8, 14), (9, 10), (10, 11), (10, 14), (11, 12), (11, 14), (12, 13), (13, 14)]\n\nHow many distinct directed paths are there from node 0 to node 14? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "84", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 15, "count": 84}} |
| {"task_id": "code-42-0029", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 14 nodes {0, 1, \u2026, 13} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (0, 3), (0, 9), (1, 2), (1, 12), (2, 3), (2, 5), (3, 4), (3, 8), (3, 11), (4, 5), (4, 6), (4, 8), (4, 9), (5, 6), (5, 10), (5, 11), (6, 7), (6, 13), (7, 8), (7, 11), (8, 9), (8, 12), (9, 10), (9, 13), (10, 11), (10, 13), (11, 12), (12, 13)]\n\nHow many distinct directed paths are there from node 0 to node 13? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "67", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 14, "count": 67}} |
| {"task_id": "code-42-0030", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n min(3, 17, 20)", "reference_answer": "3", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "min(3, 17, 20)"}} |
| {"task_id": "code-42-0031", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(7 * 43)\n\nReturn the printed value (an integer).", "reference_answer": "301", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 7, "b": 43, "op": "*"}} |
| {"task_id": "code-42-0032", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 5 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 5 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 5 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 5}} |
| {"task_id": "code-42-0033", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 4 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 4 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 4 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 4}} |
| {"task_id": "code-42-0034", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 0 modulo 9. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=1, v=45), (w=9, v=16), (w=25, v=55), (w=8, v=25), (w=11, v=50), (w=9, v=51), (w=23, v=25), (w=28, v=59), (w=20, v=38), (w=17, v=35), (w=2, v=42), (w=9, v=27), (w=8, v=36)\nConstraint: total weight \u2261 0 (mod 9)\n\nReturn only the integer optimal total value.", "reference_answer": "479", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 9, "k": 0, "optimal": 479}} |
| {"task_id": "code-42-0035", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 6 modulo 7. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=26, v=67), (w=17, v=54), (w=13, v=62), (w=19, v=38), (w=6, v=26), (w=17, v=45), (w=1, v=41), (w=29, v=57), (w=21, v=44), (w=22, v=49), (w=17, v=32), (w=9, v=16), (w=28, v=43), (w=17, v=4)\nConstraint: total weight \u2261 6 (mod 7)\n\nReturn only the integer optimal total value.", "reference_answer": "558", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 7, "k": 6, "optimal": 558}} |
| {"task_id": "code-42-0036", "family": "code", "difficulty": 0.975, "prompt": "Count the number of distinct subsets of the following list of non-negative integers whose elements sum to exactly the given target. Two subsets are distinct if their index sets differ (the empty subset counts only if the target is 0). Return a single integer.\n\nList: [3, 4, 5, 10, 8, 2, 10, 10]\nTarget: 24\n\nReturn only the integer count.", "reference_answer": "9", "estimated_seconds": 102.75, "metadata": {"generator": "_gen_text_dp_count", "tier": 0.975, "target": 24, "count": 9}} |
| {"task_id": "code-42-0037", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 6 + 5\n def g(x): return x * x\n\nWhat is the integer value of `g(f(10))`?", "reference_answer": "4225", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 6, "f_b": 5, "x": 10}} |
| {"task_id": "code-42-0038", "family": "code", "difficulty": 0.4, "prompt": "What does the following Python snippet print?\n\n a = 6\n b = 7\n total = 0\n for i in range(1, 4 + 1):\n total += a * i - b\n print(total)\n\nReturn the integer that is printed.", "reference_answer": "32", "estimated_seconds": 51.0, "metadata": {"generator": "_gen_t3_snippet", "tier": 0.4, "snippet": "a = 6\nb = 7\ntotal = 0\nfor i in range(1, 4 + 1):\n total += a * i - b\nprint(total)"}} |
| {"task_id": "code-42-0039", "family": "code", "difficulty": 0.25, "prompt": "Given the Python definition\n\n def f(x): return x * x\n\nwhat is the value of `f(10)`? Return an integer.", "reference_answer": "100", "estimated_seconds": 37.5, "metadata": {"generator": "_gen_t2_call", "tier": 0.25, "defn": "def f(x): return x * x", "call": "f(10)"}} |
| {"task_id": "code-42-0040", "family": "code", "difficulty": 0.975, "prompt": "Count the number of distinct subsets of the following list of non-negative integers whose elements sum to exactly the given target. Two subsets are distinct if their index sets differ (the empty subset counts only if the target is 0). Return a single integer.\n\nList: [1, 3, 13, 15, 2, 8, 5, 5, 3, 4, 5]\nTarget: 16\n\nReturn only the integer count.", "reference_answer": "32", "estimated_seconds": 102.75, "metadata": {"generator": "_gen_text_dp_count", "tier": 0.975, "target": 16, "count": 32}} |
| {"task_id": "code-42-0041", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(27 + 2)\n\nReturn the printed value (an integer).", "reference_answer": "29", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 27, "b": 2, "op": "+"}} |
| {"task_id": "code-42-0042", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 15 nodes {0, 1, \u2026, 14} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (1, 2), (1, 5), (1, 6), (1, 12), (1, 13), (2, 3), (2, 8), (3, 4), (3, 13), (4, 5), (4, 13), (5, 6), (5, 10), (5, 11), (5, 13), (5, 14), (6, 7), (6, 8), (6, 11), (7, 8), (7, 12), (8, 9), (8, 13), (8, 14), (9, 10), (9, 14), (10, 11), (10, 12), (10, 13), (11, 12), (12, 13), (12, 14), (13, 14)]\n\nHow many distinct directed paths are there from node 0 to node 14? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "91", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 15, "count": 91}} |
| {"task_id": "code-42-0043", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 1 modulo 10. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=27, v=50), (w=24, v=38), (w=8, v=65), (w=16, v=24), (w=18, v=10), (w=19, v=62), (w=6, v=6), (w=20, v=3), (w=11, v=58), (w=26, v=47), (w=1, v=63), (w=27, v=7), (w=17, v=44), (w=20, v=22), (w=12, v=25)\nConstraint: total weight \u2261 1 (mod 10)\n\nReturn only the integer optimal total value.", "reference_answer": "501", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 10, "k": 1, "optimal": 501}} |
| {"task_id": "code-42-0044", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the index of the maximum element in `lst` (first occurrence; behavior undefined on empty).\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return lst.index(max(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return lst.index(max(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 3}} |
| {"task_id": "code-42-0045", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 5 + 7\n def g(x): return x * x\n\nWhat is the integer value of `g(f(10))`?", "reference_answer": "3249", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 5, "f_b": 7, "x": 10}} |
| {"task_id": "code-42-0046", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 8 modulo 10. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=9, v=6), (w=29, v=1), (w=3, v=33), (w=10, v=54), (w=13, v=39), (w=26, v=41), (w=8, v=17), (w=28, v=1), (w=13, v=58), (w=27, v=22), (w=28, v=2), (w=5, v=45)\nConstraint: total weight \u2261 8 (mod 10)\n\nReturn only the integer optimal total value.", "reference_answer": "287", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 10, "k": 8, "optimal": 287}} |
| {"task_id": "code-42-0047", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 1 modulo 9. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=28, v=15), (w=27, v=10), (w=30, v=10), (w=17, v=57), (w=25, v=64), (w=11, v=6), (w=18, v=45), (w=2, v=40), (w=28, v=55), (w=10, v=41), (w=6, v=20), (w=27, v=49), (w=24, v=46), (w=12, v=59)\nConstraint: total weight \u2261 1 (mod 9)\n\nReturn only the integer optimal total value.", "reference_answer": "507", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 9, "k": 1, "optimal": 507}} |
| {"task_id": "code-42-0048", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 12 nodes {0, 1, \u2026, 11} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (0, 4), (0, 6), (0, 9), (1, 2), (1, 4), (1, 11), (2, 3), (2, 4), (2, 5), (2, 7), (2, 8), (2, 9), (3, 4), (3, 6), (3, 7), (3, 8), (3, 11), (4, 5), (4, 10), (5, 6), (5, 7), (5, 8), (5, 9), (6, 7), (6, 8), (6, 9), (6, 10), (6, 11), (7, 8), (8, 9), (8, 10), (8, 11), (9, 10), (10, 11)]\n\nHow many distinct directed paths are there from node 0 to node 11? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "118", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 12, "count": 118}} |
| {"task_id": "code-42-0049", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 16 nodes {0, 1, \u2026, 15} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (0, 2), (0, 8), (0, 11), (1, 2), (1, 7), (2, 3), (2, 6), (2, 10), (3, 4), (3, 7), (4, 5), (4, 9), (5, 6), (5, 8), (5, 11), (6, 7), (6, 9), (6, 11), (7, 8), (7, 15), (8, 9), (8, 10), (8, 13), (8, 14), (9, 10), (9, 13), (9, 15), (10, 11), (10, 12), (10, 14), (10, 15), (11, 12), (11, 14), (12, 13), (12, 14), (12, 15), (13, 14), (14, 15)]\n\nHow many distinct directed paths are there from node 0 to node 15? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "339", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 16, "count": 339}} |
| {"task_id": "code-42-0050", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the list reversed.\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return list(reversed(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return list(reversed(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 1}} |
| {"task_id": "code-42-0051", "family": "code", "difficulty": 0.25, "prompt": "Given the Python definition\n\n def f(x): return 2 - x\n\nwhat is the value of `f(2)`? Return an integer.", "reference_answer": "0", "estimated_seconds": 37.5, "metadata": {"generator": "_gen_t2_call", "tier": 0.25, "defn": "def f(x): return 2 - x", "call": "f(2)"}} |
| {"task_id": "code-42-0052", "family": "code", "difficulty": 0.4, "prompt": "What does the following Python snippet print?\n\n a = 9\n b = 3\n total = 0\n for i in range(1, 5 + 1):\n total += a * i - b\n print(total)\n\nReturn the integer that is printed.", "reference_answer": "120", "estimated_seconds": 51.0, "metadata": {"generator": "_gen_t3_snippet", "tier": 0.4, "snippet": "a = 9\nb = 3\ntotal = 0\nfor i in range(1, 5 + 1):\n total += a * i - b\nprint(total)"}} |
| {"task_id": "code-42-0053", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 3 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 3 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 3 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 3}} |
| {"task_id": "code-42-0054", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 12 nodes {0, 1, \u2026, 11} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (0, 2), (0, 11), (1, 2), (1, 3), (1, 9), (1, 11), (2, 3), (2, 4), (2, 7), (2, 10), (3, 4), (3, 5), (3, 6), (3, 8), (3, 10), (4, 5), (4, 6), (4, 11), (5, 6), (5, 7), (5, 8), (5, 9), (5, 10), (6, 7), (6, 8), (6, 10), (7, 8), (7, 11), (8, 9), (8, 10), (9, 10), (9, 11), (10, 11)]\n\nHow many distinct directed paths are there from node 0 to node 11? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "239", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 12, "count": 239}} |
| {"task_id": "code-42-0055", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n max(12, 8, 4)", "reference_answer": "12", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "max(12, 8, 4)"}} |
| {"task_id": "code-42-0056", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the index of the maximum element in `lst` (first occurrence; behavior undefined on empty).\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return lst.index(max(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return lst.index(max(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 3}} |
| {"task_id": "code-42-0057", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the sum of even numbers in `lst`.\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return sum(x for x in lst if x % 2 == 0)\n```", "reference_answer": "```python\ndef g(lst):\n return sum(x for x in lst if x % 2 == 0)\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 2}} |
| {"task_id": "code-42-0058", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 5 + 3\n def g(x): return x * x\n\nWhat is the integer value of `g(f(4))`?", "reference_answer": "529", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 5, "f_b": 3, "x": 4}} |
| {"task_id": "code-42-0059", "family": "code", "difficulty": 0.4, "prompt": "What does the following Python snippet print?\n\n a = 2\n b = 5\n total = 0\n for i in range(1, 1 + 1):\n total += a * i - b\n print(total)\n\nReturn the integer that is printed.", "reference_answer": "-3", "estimated_seconds": 51.0, "metadata": {"generator": "_gen_t3_snippet", "tier": 0.4, "snippet": "a = 2\nb = 5\ntotal = 0\nfor i in range(1, 1 + 1):\n total += a * i - b\nprint(total)"}} |
| {"task_id": "code-42-0060", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 5 + 7\n def g(x): return x * x\n\nWhat is the integer value of `g(f(9))`?", "reference_answer": "2704", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 5, "f_b": 7, "x": 9}} |
| {"task_id": "code-42-0061", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n len('xx')", "reference_answer": "2", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "len('xx')"}} |
| {"task_id": "code-42-0062", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 3 modulo 9. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=6, v=29), (w=15, v=13), (w=23, v=40), (w=2, v=6), (w=16, v=19), (w=19, v=34), (w=14, v=45), (w=21, v=53), (w=4, v=53), (w=23, v=67), (w=17, v=49), (w=22, v=12), (w=4, v=47), (w=9, v=7)\nConstraint: total weight \u2261 3 (mod 9)\n\nReturn only the integer optimal total value.", "reference_answer": "443", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 9, "k": 3, "optimal": 443}} |
| {"task_id": "code-42-0063", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 5 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 5 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 5 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 5}} |
| {"task_id": "code-42-0064", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 8 modulo 11. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=7, v=6), (w=10, v=52), (w=16, v=67), (w=12, v=18), (w=1, v=51), (w=3, v=19), (w=13, v=64), (w=26, v=61), (w=16, v=15), (w=21, v=2), (w=5, v=4), (w=26, v=11), (w=19, v=29), (w=2, v=7)\nConstraint: total weight \u2261 8 (mod 11)\n\nReturn only the integer optimal total value.", "reference_answer": "400", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 11, "k": 8, "optimal": 400}} |
| {"task_id": "code-42-0065", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 13 nodes {0, 1, \u2026, 12} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (0, 8), (0, 10), (1, 2), (1, 4), (1, 6), (1, 10), (1, 11), (2, 3), (2, 4), (2, 8), (3, 4), (3, 6), (3, 7), (3, 12), (4, 5), (4, 6), (4, 8), (4, 9), (4, 10), (5, 6), (5, 8), (5, 9), (6, 7), (6, 9), (6, 11), (6, 12), (7, 8), (7, 10), (7, 12), (8, 9), (8, 10), (8, 11), (8, 12), (9, 10), (10, 11), (10, 12), (11, 12)]\n\nHow many distinct directed paths are there from node 0 to node 12? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "185", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 13, "count": 185}} |
| {"task_id": "code-42-0066", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(47 - 14)\n\nReturn the printed value (an integer).", "reference_answer": "33", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 47, "b": 14, "op": "-"}} |
| {"task_id": "code-42-0067", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 5 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 5 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 5 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 5}} |
| {"task_id": "code-42-0068", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 3 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 3 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 3 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 3}} |
| {"task_id": "code-42-0069", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n abs(21 - 8)", "reference_answer": "13", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "abs(21 - 8)"}} |
| {"task_id": "code-42-0070", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 15 nodes {0, 1, \u2026, 14} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (0, 2), (0, 7), (0, 11), (1, 2), (1, 4), (1, 5), (1, 12), (1, 13), (2, 3), (2, 7), (2, 12), (2, 13), (2, 14), (3, 4), (3, 10), (3, 11), (4, 5), (4, 12), (4, 14), (5, 6), (5, 7), (5, 9), (6, 7), (7, 8), (7, 9), (7, 11), (7, 13), (7, 14), (8, 9), (8, 10), (9, 10), (10, 11), (10, 12), (10, 14), (11, 12), (11, 14), (12, 13), (12, 14), (13, 14)]\n\nHow many distinct directed paths are there from node 0 to node 14? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "318", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 15, "count": 318}} |
| {"task_id": "code-42-0071", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 4 + 6\n def g(x): return x * x\n\nWhat is the integer value of `g(f(10))`?", "reference_answer": "2116", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 4, "f_b": 6, "x": 10}} |
| {"task_id": "code-42-0072", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 5 + 3\n def g(x): return x * x\n\nWhat is the integer value of `g(f(11))`?", "reference_answer": "3364", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 5, "f_b": 3, "x": 11}} |
| {"task_id": "code-42-0073", "family": "code", "difficulty": 0.975, "prompt": "Count the number of distinct subsets of the following list of non-negative integers whose elements sum to exactly the given target. Two subsets are distinct if their index sets differ (the empty subset counts only if the target is 0). Return a single integer.\n\nList: [8, 11, 15, 8, 9, 12, 10, 9, 11]\nTarget: 64\n\nReturn only the integer count.", "reference_answer": "10", "estimated_seconds": 102.75, "metadata": {"generator": "_gen_text_dp_count", "tier": 0.975, "target": 64, "count": 10}} |
| {"task_id": "code-42-0074", "family": "code", "difficulty": 0.25, "prompt": "Given the Python definition\n\n def f(x): return x * 9\n\nwhat is the value of `f(14)`? Return an integer.", "reference_answer": "126", "estimated_seconds": 37.5, "metadata": {"generator": "_gen_t2_call", "tier": 0.25, "defn": "def f(x): return x * 9", "call": "f(14)"}} |
| {"task_id": "code-42-0075", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(21 - 27)\n\nReturn the printed value (an integer).", "reference_answer": "-6", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 21, "b": 27, "op": "-"}} |
| {"task_id": "code-42-0076", "family": "code", "difficulty": 0.975, "prompt": "Count the number of distinct subsets of the following list of non-negative integers whose elements sum to exactly the given target. Two subsets are distinct if their index sets differ (the empty subset counts only if the target is 0). Return a single integer.\n\nList: [4, 2, 9, 1, 11, 11, 14, 13, 5, 9, 1, 1]\nTarget: 55\n\nReturn only the integer count.", "reference_answer": "76", "estimated_seconds": 102.75, "metadata": {"generator": "_gen_text_dp_count", "tier": 0.975, "target": 55, "count": 76}} |
| {"task_id": "code-42-0077", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 7 + 4\n def g(x): return x * x\n\nWhat is the integer value of `g(f(11))`?", "reference_answer": "6561", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 7, "f_b": 4, "x": 11}} |
| {"task_id": "code-42-0078", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the sorted, deduplicated list (ascending).\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return sorted(set(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return sorted(set(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 0}} |
| {"task_id": "code-42-0079", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 16 nodes {0, 1, \u2026, 15} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (0, 2), (0, 7), (0, 10), (0, 11), (0, 14), (1, 2), (1, 5), (1, 6), (2, 3), (2, 10), (3, 4), (3, 5), (3, 11), (3, 14), (4, 5), (4, 7), (4, 11), (5, 6), (5, 8), (5, 11), (5, 14), (6, 7), (6, 8), (6, 12), (7, 8), (7, 10), (7, 13), (7, 14), (8, 9), (8, 11), (8, 14), (8, 15), (9, 10), (9, 13), (9, 14), (9, 15), (10, 11), (10, 14), (11, 12), (11, 15), (12, 13), (12, 14), (13, 14), (14, 15)]\n\nHow many distinct directed paths are there from node 0 to node 15? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "356", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 16, "count": 356}} |
| {"task_id": "code-42-0080", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the index of the maximum element in `lst` (first occurrence; behavior undefined on empty).\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return lst.index(max(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return lst.index(max(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 3}} |
| {"task_id": "code-42-0081", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n max(27, 11, 16)", "reference_answer": "27", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "max(27, 11, 16)"}} |
| {"task_id": "code-42-0082", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n min(26, 14, 40)", "reference_answer": "14", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "min(26, 14, 40)"}} |
| {"task_id": "code-42-0083", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the index of the maximum element in `lst` (first occurrence; behavior undefined on empty).\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return lst.index(max(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return lst.index(max(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 3}} |
| {"task_id": "code-42-0084", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 2 modulo 5. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=2, v=13), (w=1, v=51), (w=13, v=9), (w=28, v=39), (w=6, v=15), (w=1, v=22), (w=29, v=27), (w=28, v=34), (w=28, v=36), (w=1, v=23), (w=3, v=15), (w=13, v=45), (w=24, v=26), (w=27, v=24), (w=23, v=2)\nConstraint: total weight \u2261 2 (mod 5)\n\nReturn only the integer optimal total value.", "reference_answer": "381", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 5, "k": 2, "optimal": 381}} |
| {"task_id": "code-42-0085", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 2 + 1\n def g(x): return x * x\n\nWhat is the integer value of `g(f(10))`?", "reference_answer": "441", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 2, "f_b": 1, "x": 10}} |
| {"task_id": "code-42-0086", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 6 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 6 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 6 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 6}} |
| {"task_id": "code-42-0087", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 4 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 4 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 4 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 4}} |
| {"task_id": "code-42-0088", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n abs(29 - 12)", "reference_answer": "17", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "abs(29 - 12)"}} |
| {"task_id": "code-42-0089", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 16 nodes {0, 1, \u2026, 15} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (0, 3), (0, 8), (0, 13), (1, 2), (1, 3), (1, 8), (1, 10), (2, 3), (2, 5), (2, 6), (3, 4), (3, 7), (3, 8), (3, 11), (3, 13), (4, 5), (4, 6), (4, 7), (4, 11), (4, 12), (4, 14), (5, 6), (5, 13), (6, 7), (6, 11), (6, 14), (7, 8), (8, 9), (8, 13), (9, 10), (9, 11), (9, 13), (9, 14), (9, 15), (10, 11), (11, 12), (12, 13), (12, 14), (13, 14), (13, 15), (14, 15)]\n\nHow many distinct directed paths are there from node 0 to node 15? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "309", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 16, "count": 309}} |
| {"task_id": "code-42-0090", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the list reversed.\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return list(reversed(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return list(reversed(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 1}} |
| {"task_id": "code-42-0091", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(11 + 15)\n\nReturn the printed value (an integer).", "reference_answer": "26", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 11, "b": 15, "op": "+"}} |
| {"task_id": "code-42-0092", "family": "code", "difficulty": 0.4, "prompt": "What does the following Python snippet print?\n\n a = 5\n b = 8\n total = 0\n for i in range(1, 1 + 1):\n total += a * i - b\n print(total)\n\nReturn the integer that is printed.", "reference_answer": "-3", "estimated_seconds": 51.0, "metadata": {"generator": "_gen_t3_snippet", "tier": 0.4, "snippet": "a = 5\nb = 8\ntotal = 0\nfor i in range(1, 1 + 1):\n total += a * i - b\nprint(total)"}} |
| {"task_id": "code-42-0093", "family": "code", "difficulty": 0.4, "prompt": "What does the following Python snippet print?\n\n a = 10\n b = 9\n total = 0\n for i in range(1, 2 + 1):\n total += a * i - b\n print(total)\n\nReturn the integer that is printed.", "reference_answer": "12", "estimated_seconds": 51.0, "metadata": {"generator": "_gen_t3_snippet", "tier": 0.4, "snippet": "a = 10\nb = 9\ntotal = 0\nfor i in range(1, 2 + 1):\n total += a * i - b\nprint(total)"}} |
| {"task_id": "code-42-0094", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 14 nodes {0, 1, \u2026, 13} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (0, 12), (1, 2), (1, 7), (2, 3), (2, 10), (3, 4), (3, 10), (3, 11), (4, 5), (4, 6), (4, 9), (5, 6), (5, 7), (5, 8), (6, 7), (6, 10), (7, 8), (7, 11), (7, 12), (8, 9), (8, 10), (8, 12), (9, 10), (9, 12), (10, 11), (11, 12), (11, 13), (12, 13)]\n\nHow many distinct directed paths are there from node 0 to node 13? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "56", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 14, "count": 56}} |
| {"task_id": "code-42-0095", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the index of the maximum element in `lst` (first occurrence; behavior undefined on empty).\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return lst.index(max(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return lst.index(max(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 3}} |
| {"task_id": "code-42-0096", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 2 modulo 5. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=10, v=46), (w=18, v=43), (w=9, v=4), (w=2, v=17), (w=17, v=24), (w=5, v=41), (w=6, v=6), (w=15, v=19), (w=17, v=8), (w=30, v=42), (w=22, v=16), (w=11, v=63), (w=18, v=49)\nConstraint: total weight \u2261 2 (mod 5)\n\nReturn only the integer optimal total value.", "reference_answer": "364", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 5, "k": 2, "optimal": 364}} |
| {"task_id": "code-42-0097", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n min(9, 8, 17)", "reference_answer": "8", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "min(9, 8, 17)"}} |
| {"task_id": "code-42-0098", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 9 modulo 10. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=9, v=28), (w=13, v=32), (w=13, v=35), (w=6, v=2), (w=15, v=10), (w=12, v=3), (w=26, v=31), (w=18, v=15), (w=29, v=66), (w=11, v=21), (w=30, v=38), (w=26, v=5), (w=22, v=1), (w=1, v=38), (w=12, v=44)\nConstraint: total weight \u2261 9 (mod 10)\n\nReturn only the integer optimal total value.", "reference_answer": "365", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 10, "k": 9, "optimal": 365}} |
| {"task_id": "code-42-0099", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 13 nodes {0, 1, \u2026, 12} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (0, 12), (1, 2), (1, 12), (2, 3), (2, 6), (2, 11), (2, 12), (3, 4), (3, 12), (4, 5), (4, 7), (4, 10), (4, 12), (5, 6), (5, 10), (5, 11), (6, 7), (6, 10), (6, 11), (7, 8), (7, 10), (7, 11), (7, 12), (8, 9), (8, 11), (9, 10), (9, 11), (10, 11), (10, 12), (11, 12)]\n\nHow many distinct directed paths are there from node 0 to node 12? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "41", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 13, "count": 41}} |
| {"task_id": "code-42-0100", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 6 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 6 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 6 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 6}} |
| {"task_id": "code-42-0101", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n 15 % 19", "reference_answer": "15", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "15 % 19"}} |
| {"task_id": "code-42-0102", "family": "code", "difficulty": 0.85, "prompt": "The following Python function has a one-line bug:\n\n```python\ndef h(x):\n return x + 18 # BUG: should be x - 18\n```\n\nReply with the corrected function (just the def block, in a python code fence). Three calls of the form `h(x)` will be checked.", "reference_answer": "```python\ndef h(x):\n return x - 18\n```", "estimated_seconds": 91.5, "metadata": {"generator": "_gen_t6_bugfix", "tier": 0.85, "variant": 1}} |
| {"task_id": "code-42-0103", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 3 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 3 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 3 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 3}} |
| {"task_id": "code-42-0104", "family": "code", "difficulty": 0.975, "prompt": "Count the number of distinct subsets of the following list of non-negative integers whose elements sum to exactly the given target. Two subsets are distinct if their index sets differ (the empty subset counts only if the target is 0). Return a single integer.\n\nList: [11, 14, 12, 15, 3, 5, 14, 14, 12]\nTarget: 77\n\nReturn only the integer count.", "reference_answer": "3", "estimated_seconds": 102.75, "metadata": {"generator": "_gen_text_dp_count", "tier": 0.975, "target": 77, "count": 3}} |
| {"task_id": "code-42-0105", "family": "code", "difficulty": 0.4, "prompt": "What does the following Python snippet print?\n\n a = 10\n b = 9\n total = 0\n for i in range(1, 4 + 1):\n total += a * i - b\n print(total)\n\nReturn the integer that is printed.", "reference_answer": "64", "estimated_seconds": 51.0, "metadata": {"generator": "_gen_t3_snippet", "tier": 0.4, "snippet": "a = 10\nb = 9\ntotal = 0\nfor i in range(1, 4 + 1):\n total += a * i - b\nprint(total)"}} |
| {"task_id": "code-42-0106", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 3 modulo 6. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=28, v=15), (w=25, v=27), (w=24, v=67), (w=11, v=61), (w=27, v=60), (w=23, v=62), (w=26, v=22), (w=17, v=18), (w=21, v=68), (w=7, v=53), (w=14, v=57)\nConstraint: total weight \u2261 3 (mod 6)\n\nReturn only the integer optimal total value.", "reference_answer": "495", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 6, "k": 3, "optimal": 495}} |
| {"task_id": "code-42-0107", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 7 + 2\n def g(x): return x * x\n\nWhat is the integer value of `g(f(5))`?", "reference_answer": "1369", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 7, "f_b": 2, "x": 5}} |
| {"task_id": "code-42-0108", "family": "code", "difficulty": 0.85, "prompt": "The following Python function has a one-line bug:\n\n```python\ndef h(x):\n return x // 2 # BUG: should be x % 2\n```\n\nReply with the corrected function (just the def block, in a python code fence). Three calls of the form `h(x)` will be checked.", "reference_answer": "```python\ndef h(x):\n return x % 2\n```", "estimated_seconds": 91.5, "metadata": {"generator": "_gen_t6_bugfix", "tier": 0.85, "variant": 2}} |
| {"task_id": "code-42-0109", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(19 * 8)\n\nReturn the printed value (an integer).", "reference_answer": "152", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 19, "b": 8, "op": "*"}} |
| {"task_id": "code-42-0110", "family": "code", "difficulty": 0.25, "prompt": "Given the Python definition\n\n def f(x): return x ** 2 - x\n\nwhat is the value of `f(6)`? Return an integer.", "reference_answer": "30", "estimated_seconds": 37.5, "metadata": {"generator": "_gen_t2_call", "tier": 0.25, "defn": "def f(x): return x ** 2 - x", "call": "f(6)"}} |
| {"task_id": "code-42-0111", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 4 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 4 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 4 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 4}} |
| {"task_id": "code-42-0112", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 2 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 2 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 2 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 2}} |
| {"task_id": "code-42-0113", "family": "code", "difficulty": 0.4, "prompt": "What does the following Python snippet print?\n\n a = 10\n b = 2\n total = 0\n for i in range(1, 2 + 1):\n total += a * i - b\n print(total)\n\nReturn the integer that is printed.", "reference_answer": "26", "estimated_seconds": 51.0, "metadata": {"generator": "_gen_t3_snippet", "tier": 0.4, "snippet": "a = 10\nb = 2\ntotal = 0\nfor i in range(1, 2 + 1):\n total += a * i - b\nprint(total)"}} |
| {"task_id": "code-42-0114", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 1 modulo 5. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=14, v=26), (w=9, v=5), (w=6, v=9), (w=28, v=44), (w=12, v=26), (w=25, v=47), (w=16, v=43), (w=16, v=47), (w=9, v=30), (w=7, v=65), (w=29, v=46)\nConstraint: total weight \u2261 1 (mod 5)\n\nReturn only the integer optimal total value.", "reference_answer": "388", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 5, "k": 1, "optimal": 388}} |
| {"task_id": "code-42-0115", "family": "code", "difficulty": 0.85, "prompt": "The following Python function has a one-line bug:\n\n```python\ndef h(x):\n return x * x + 13 # BUG: should be x*x - 13\n```\n\nReply with the corrected function (just the def block, in a python code fence). Three calls of the form `h(x)` will be checked.", "reference_answer": "```python\ndef h(x):\n return x * x - 13\n```", "estimated_seconds": 91.5, "metadata": {"generator": "_gen_t6_bugfix", "tier": 0.85, "variant": 0}} |
| {"task_id": "code-42-0116", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 14 nodes {0, 1, \u2026, 13} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (0, 4), (0, 5), (0, 12), (1, 2), (1, 4), (1, 6), (1, 9), (1, 11), (1, 13), (2, 3), (2, 7), (2, 10), (2, 12), (2, 13), (3, 4), (3, 8), (4, 5), (4, 11), (4, 13), (5, 6), (5, 11), (5, 12), (5, 13), (6, 7), (6, 12), (6, 13), (7, 8), (7, 10), (7, 12), (8, 9), (8, 12), (8, 13), (9, 10), (9, 13), (10, 11), (10, 12), (10, 13), (11, 12), (11, 13), (12, 13)]\n\nHow many distinct directed paths are there from node 0 to node 13? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "129", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 14, "count": 129}} |
| {"task_id": "code-42-0117", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(20 + 28)\n\nReturn the printed value (an integer).", "reference_answer": "48", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 20, "b": 28, "op": "+"}} |
| {"task_id": "code-42-0118", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 4 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 4 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 4 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 4}} |
| {"task_id": "code-42-0119", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n len('xxxxxxxxxxxxxxx')", "reference_answer": "15", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "len('xxxxxxxxxxxxxxx')"}} |
| {"task_id": "code-42-0120", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 3 modulo 7. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=17, v=43), (w=1, v=37), (w=10, v=33), (w=25, v=20), (w=5, v=24), (w=9, v=52), (w=25, v=28), (w=13, v=19), (w=16, v=31), (w=5, v=44), (w=16, v=60), (w=14, v=24), (w=24, v=2), (w=19, v=69)\nConstraint: total weight \u2261 3 (mod 7)\n\nReturn only the integer optimal total value.", "reference_answer": "486", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 7, "k": 3, "optimal": 486}} |
| {"task_id": "code-42-0121", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n 8 ** 2", "reference_answer": "64", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "8 ** 2"}} |
| {"task_id": "code-42-0122", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 6 + 3\n def g(x): return x * x\n\nWhat is the integer value of `g(f(11))`?", "reference_answer": "4761", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 6, "f_b": 3, "x": 11}} |
| {"task_id": "code-42-0123", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 2 modulo 5. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=27, v=12), (w=21, v=43), (w=4, v=50), (w=11, v=55), (w=25, v=9), (w=21, v=27), (w=22, v=37), (w=30, v=8), (w=12, v=5), (w=30, v=19), (w=25, v=19), (w=7, v=61), (w=16, v=36), (w=20, v=41), (w=17, v=40)\nConstraint: total weight \u2261 2 (mod 5)\n\nReturn only the integer optimal total value.", "reference_answer": "435", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 5, "k": 2, "optimal": 435}} |
| {"task_id": "code-42-0124", "family": "code", "difficulty": 0.85, "prompt": "The following Python function has a one-line bug:\n\n```python\ndef h(x):\n return x // 19 # BUG: should be x % 19\n```\n\nReply with the corrected function (just the def block, in a python code fence). Three calls of the form `h(x)` will be checked.", "reference_answer": "```python\ndef h(x):\n return x % 19\n```", "estimated_seconds": 91.5, "metadata": {"generator": "_gen_t6_bugfix", "tier": 0.85, "variant": 2}} |
| {"task_id": "code-42-0125", "family": "code", "difficulty": 0.85, "prompt": "The following Python function has a one-line bug:\n\n```python\ndef h(x):\n return x + 5 # BUG: should be x - 5\n```\n\nReply with the corrected function (just the def block, in a python code fence). Three calls of the form `h(x)` will be checked.", "reference_answer": "```python\ndef h(x):\n return x - 5\n```", "estimated_seconds": 91.5, "metadata": {"generator": "_gen_t6_bugfix", "tier": 0.85, "variant": 1}} |
| {"task_id": "code-42-0126", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(30 * 40)\n\nReturn the printed value (an integer).", "reference_answer": "1200", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 30, "b": 40, "op": "*"}} |
| {"task_id": "code-42-0127", "family": "code", "difficulty": 0.975, "prompt": "Count the number of distinct subsets of the following list of non-negative integers whose elements sum to exactly the given target. Two subsets are distinct if their index sets differ (the empty subset counts only if the target is 0). Return a single integer.\n\nList: [3, 4, 2, 5, 11, 1, 1, 14, 15, 14, 9, 2]\nTarget: 64\n\nReturn only the integer count.", "reference_answer": "37", "estimated_seconds": 102.75, "metadata": {"generator": "_gen_text_dp_count", "tier": 0.975, "target": 64, "count": 37}} |
| {"task_id": "code-42-0128", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 2 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 2 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 2 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 2}} |
| {"task_id": "code-42-0129", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n max(10, 14, -4)", "reference_answer": "14", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "max(10, 14, -4)"}} |
| {"task_id": "code-42-0130", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n len('xxxxxxxxxxxxxxxxxxxxx')", "reference_answer": "21", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "len('xxxxxxxxxxxxxxxxxxxxx')"}} |
| {"task_id": "code-42-0131", "family": "code", "difficulty": 0.25, "prompt": "Given the Python definition\n\n def f(x): return x * x\n\nwhat is the value of `f(8)`? Return an integer.", "reference_answer": "64", "estimated_seconds": 37.5, "metadata": {"generator": "_gen_t2_call", "tier": 0.25, "defn": "def f(x): return x * x", "call": "f(8)"}} |
| {"task_id": "code-42-0132", "family": "code", "difficulty": 0.4, "prompt": "What does the following Python snippet print?\n\n a = 11\n b = 9\n total = 0\n for i in range(1, 2 + 1):\n total += a * i - b\n print(total)\n\nReturn the integer that is printed.", "reference_answer": "15", "estimated_seconds": 51.0, "metadata": {"generator": "_gen_t3_snippet", "tier": 0.4, "snippet": "a = 11\nb = 9\ntotal = 0\nfor i in range(1, 2 + 1):\n total += a * i - b\nprint(total)"}} |
| {"task_id": "code-42-0133", "family": "code", "difficulty": 0.25, "prompt": "Given the Python definition\n\n def f(x): return 7 - x\n\nwhat is the value of `f(11)`? Return an integer.", "reference_answer": "-4", "estimated_seconds": 37.5, "metadata": {"generator": "_gen_t2_call", "tier": 0.25, "defn": "def f(x): return 7 - x", "call": "f(11)"}} |
| {"task_id": "code-42-0134", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n 8 % 11", "reference_answer": "8", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "8 % 11"}} |
| {"task_id": "code-42-0135", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 4 + 2\n def g(x): return x * x\n\nWhat is the integer value of `g(f(9))`?", "reference_answer": "1444", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 4, "f_b": 2, "x": 9}} |
| {"task_id": "code-42-0136", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 6 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 6 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 6 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 6}} |
| {"task_id": "code-42-0137", "family": "code", "difficulty": 0.4, "prompt": "What does the following Python snippet print?\n\n a = 9\n b = 10\n total = 0\n for i in range(1, 3 + 1):\n total += a * i - b\n print(total)\n\nReturn the integer that is printed.", "reference_answer": "24", "estimated_seconds": 51.0, "metadata": {"generator": "_gen_t3_snippet", "tier": 0.4, "snippet": "a = 9\nb = 10\ntotal = 0\nfor i in range(1, 3 + 1):\n total += a * i - b\nprint(total)"}} |
| {"task_id": "code-42-0138", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n 12 // 5", "reference_answer": "2", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "12 // 5"}} |
| {"task_id": "code-42-0139", "family": "code", "difficulty": 0.975, "prompt": "Count the number of distinct subsets of the following list of non-negative integers whose elements sum to exactly the given target. Two subsets are distinct if their index sets differ (the empty subset counts only if the target is 0). Return a single integer.\n\nList: [10, 14, 13, 3, 2, 12, 13, 5, 9, 12, 3, 4]\nTarget: 65\n\nReturn only the integer count.", "reference_answer": "63", "estimated_seconds": 102.75, "metadata": {"generator": "_gen_text_dp_count", "tier": 0.975, "target": 65, "count": 63}} |
| {"task_id": "code-42-0140", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(14 * 38)\n\nReturn the printed value (an integer).", "reference_answer": "532", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 14, "b": 38, "op": "*"}} |
| {"task_id": "code-42-0141", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the list reversed.\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return list(reversed(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return list(reversed(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 1}} |
| {"task_id": "code-42-0142", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 0 modulo 7. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=14, v=29), (w=22, v=65), (w=14, v=35), (w=15, v=42), (w=20, v=30), (w=16, v=19), (w=24, v=56), (w=16, v=51), (w=27, v=16), (w=25, v=33), (w=27, v=12)\nConstraint: total weight \u2261 0 (mod 7)\n\nReturn only the integer optimal total value.", "reference_answer": "343", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 7, "k": 0, "optimal": 343}} |
| {"task_id": "code-42-0143", "family": "code", "difficulty": 0.85, "prompt": "The following Python function has a one-line bug:\n\n```python\ndef h(x):\n return x * x + 16 # BUG: should be x*x - 16\n```\n\nReply with the corrected function (just the def block, in a python code fence). Three calls of the form `h(x)` will be checked.", "reference_answer": "```python\ndef h(x):\n return x * x - 16\n```", "estimated_seconds": 91.5, "metadata": {"generator": "_gen_t6_bugfix", "tier": 0.85, "variant": 0}} |
| {"task_id": "code-42-0144", "family": "code", "difficulty": 0.25, "prompt": "Given the Python definition\n\n def f(x): return x * 5\n\nwhat is the value of `f(12)`? Return an integer.", "reference_answer": "60", "estimated_seconds": 37.5, "metadata": {"generator": "_gen_t2_call", "tier": 0.25, "defn": "def f(x): return x * 5", "call": "f(12)"}} |
| {"task_id": "code-42-0145", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 1 modulo 5. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=5, v=63), (w=4, v=19), (w=20, v=13), (w=21, v=25), (w=20, v=45), (w=16, v=33), (w=10, v=31), (w=16, v=46), (w=18, v=16), (w=28, v=18), (w=29, v=39)\nConstraint: total weight \u2261 1 (mod 5)\n\nReturn only the integer optimal total value.", "reference_answer": "323", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 5, "k": 1, "optimal": 323}} |
| {"task_id": "code-42-0146", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 3 + 6\n def g(x): return x * x\n\nWhat is the integer value of `g(f(9))`?", "reference_answer": "1089", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 3, "f_b": 6, "x": 9}} |
| {"task_id": "code-42-0147", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the index of the maximum element in `lst` (first occurrence; behavior undefined on empty).\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return lst.index(max(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return lst.index(max(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 3}} |
| {"task_id": "code-42-0148", "family": "code", "difficulty": 0.25, "prompt": "Given the Python definition\n\n def f(x): return x + 3\n\nwhat is the value of `f(12)`? Return an integer.", "reference_answer": "15", "estimated_seconds": 37.5, "metadata": {"generator": "_gen_t2_call", "tier": 0.25, "defn": "def f(x): return x + 3", "call": "f(12)"}} |
| {"task_id": "code-42-0149", "family": "code", "difficulty": 0.4, "prompt": "What does the following Python snippet print?\n\n a = 7\n b = 10\n total = 0\n for i in range(1, 4 + 1):\n total += a * i - b\n print(total)\n\nReturn the integer that is printed.", "reference_answer": "30", "estimated_seconds": 51.0, "metadata": {"generator": "_gen_t3_snippet", "tier": 0.4, "snippet": "a = 7\nb = 10\ntotal = 0\nfor i in range(1, 4 + 1):\n total += a * i - b\nprint(total)"}} |
| {"task_id": "code-42-0150", "family": "code", "difficulty": 0.15, "prompt": "Evaluate this Python expression and return its integer value:\n\n abs(2 - 17)", "reference_answer": "15", "estimated_seconds": 28.5, "metadata": {"generator": "_gen_t1_oneliner", "tier": 0.15, "expr": "abs(2 - 17)"}} |
| {"task_id": "code-42-0151", "family": "code", "difficulty": 0.4, "prompt": "What does the following Python snippet print?\n\n a = 4\n b = 7\n total = 0\n for i in range(1, 5 + 1):\n total += a * i - b\n print(total)\n\nReturn the integer that is printed.", "reference_answer": "25", "estimated_seconds": 51.0, "metadata": {"generator": "_gen_t3_snippet", "tier": 0.4, "snippet": "a = 4\nb = 7\ntotal = 0\nfor i in range(1, 5 + 1):\n total += a * i - b\nprint(total)"}} |
| {"task_id": "code-42-0152", "family": "code", "difficulty": 0.4, "prompt": "What does the following Python snippet print?\n\n a = 4\n b = 4\n total = 0\n for i in range(1, 4 + 1):\n total += a * i - b\n print(total)\n\nReturn the integer that is printed.", "reference_answer": "24", "estimated_seconds": 51.0, "metadata": {"generator": "_gen_t3_snippet", "tier": 0.4, "snippet": "a = 4\nb = 4\ntotal = 0\nfor i in range(1, 4 + 1):\n total += a * i - b\nprint(total)"}} |
| {"task_id": "code-42-0153", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the list reversed.\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return list(reversed(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return list(reversed(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 1}} |
| {"task_id": "code-42-0154", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 6 modulo 8. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=21, v=10), (w=1, v=36), (w=24, v=60), (w=2, v=44), (w=29, v=25), (w=19, v=15), (w=25, v=17), (w=3, v=36), (w=26, v=58), (w=28, v=12), (w=20, v=70)\nConstraint: total weight \u2261 6 (mod 8)\n\nReturn only the integer optimal total value.", "reference_answer": "383", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 8, "k": 6, "optimal": 383}} |
| {"task_id": "code-42-0155", "family": "code", "difficulty": 0.975, "prompt": "Count the number of distinct subsets of the following list of non-negative integers whose elements sum to exactly the given target. Two subsets are distinct if their index sets differ (the empty subset counts only if the target is 0). Return a single integer.\n\nList: [4, 3, 5, 5, 4, 7, 8, 7, 12]\nTarget: 30\n\nReturn only the integer count.", "reference_answer": "13", "estimated_seconds": 102.75, "metadata": {"generator": "_gen_text_dp_count", "tier": 0.975, "target": 30, "count": 13}} |
| {"task_id": "code-42-0156", "family": "code", "difficulty": 0.975, "prompt": "Count the number of distinct subsets of the following list of non-negative integers whose elements sum to exactly the given target. Two subsets are distinct if their index sets differ (the empty subset counts only if the target is 0). Return a single integer.\n\nList: [11, 12, 8, 4, 2, 9, 9, 7, 6, 14, 1]\nTarget: 41\n\nReturn only the integer count.", "reference_answer": "57", "estimated_seconds": 102.75, "metadata": {"generator": "_gen_text_dp_count", "tier": 0.975, "target": 41, "count": 57}} |
| {"task_id": "code-42-0157", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 6 modulo 11. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=4, v=33), (w=23, v=41), (w=15, v=36), (w=12, v=55), (w=6, v=25), (w=30, v=60), (w=13, v=32), (w=27, v=61), (w=17, v=31), (w=15, v=56), (w=18, v=36)\nConstraint: total weight \u2261 6 (mod 11)\n\nReturn only the integer optimal total value.", "reference_answer": "398", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 11, "k": 6, "optimal": 398}} |
| {"task_id": "code-42-0158", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 5 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 5 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 5 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 5}} |
| {"task_id": "code-42-0159", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the sorted, deduplicated list (ascending).\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return sorted(set(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return sorted(set(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 0}} |
| {"task_id": "code-42-0160", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the list reversed.\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return list(reversed(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return list(reversed(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 1}} |
| {"task_id": "code-42-0161", "family": "code", "difficulty": 0.4, "prompt": "What does the following Python snippet print?\n\n a = 2\n b = 11\n total = 0\n for i in range(1, 5 + 1):\n total += a * i - b\n print(total)\n\nReturn the integer that is printed.", "reference_answer": "-25", "estimated_seconds": 51.0, "metadata": {"generator": "_gen_t3_snippet", "tier": 0.4, "snippet": "a = 2\nb = 11\ntotal = 0\nfor i in range(1, 5 + 1):\n total += a * i - b\nprint(total)"}} |
| {"task_id": "code-42-0162", "family": "code", "difficulty": 0.85, "prompt": "The following Python function has a one-line bug:\n\n```python\ndef h(x):\n return x + 14 # BUG: should be x - 14\n```\n\nReply with the corrected function (just the def block, in a python code fence). Three calls of the form `h(x)` will be checked.", "reference_answer": "```python\ndef h(x):\n return x - 14\n```", "estimated_seconds": 91.5, "metadata": {"generator": "_gen_t6_bugfix", "tier": 0.85, "variant": 1}} |
| {"task_id": "code-42-0163", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 12 nodes {0, 1, \u2026, 11} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (0, 10), (1, 2), (1, 5), (1, 7), (1, 8), (1, 10), (2, 3), (2, 4), (2, 11), (3, 4), (3, 6), (3, 7), (3, 11), (4, 5), (4, 6), (4, 7), (5, 6), (5, 7), (5, 8), (5, 11), (6, 7), (6, 8), (6, 9), (7, 8), (7, 9), (7, 10), (8, 9), (8, 10), (8, 11), (9, 10), (9, 11), (10, 11)]\n\nHow many distinct directed paths are there from node 0 to node 11? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "150", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 12, "count": 150}} |
| {"task_id": "code-42-0164", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(14 * 21)\n\nReturn the printed value (an integer).", "reference_answer": "294", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 14, "b": 21, "op": "*"}} |
| {"task_id": "code-42-0165", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the sorted, deduplicated list (ascending).\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return sorted(set(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return sorted(set(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 0}} |
| {"task_id": "code-42-0166", "family": "code", "difficulty": 0.975, "prompt": "Count the number of distinct subsets of the following list of non-negative integers whose elements sum to exactly the given target. Two subsets are distinct if their index sets differ (the empty subset counts only if the target is 0). Return a single integer.\n\nList: [14, 14, 15, 9, 5, 13, 15, 15, 2]\nTarget: 49\n\nReturn only the integer count.", "reference_answer": "12", "estimated_seconds": 102.75, "metadata": {"generator": "_gen_text_dp_count", "tier": 0.975, "target": 49, "count": 12}} |
| {"task_id": "code-42-0167", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 4 modulo 10. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=30, v=40), (w=21, v=15), (w=22, v=45), (w=19, v=40), (w=16, v=22), (w=27, v=44), (w=16, v=63), (w=20, v=53), (w=30, v=23), (w=29, v=69), (w=18, v=35), (w=26, v=25), (w=13, v=62), (w=23, v=68)\nConstraint: total weight \u2261 4 (mod 10)\n\nReturn only the integer optimal total value.", "reference_answer": "582", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 10, "k": 4, "optimal": 582}} |
| {"task_id": "code-42-0168", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(36 + 49)\n\nReturn the printed value (an integer).", "reference_answer": "85", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 36, "b": 49, "op": "+"}} |
| {"task_id": "code-42-0169", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(19 * 49)\n\nReturn the printed value (an integer).", "reference_answer": "931", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 19, "b": 49, "op": "*"}} |
| {"task_id": "code-42-0170", "family": "code", "difficulty": 0.25, "prompt": "Given the Python definition\n\n def f(x): return x * x\n\nwhat is the value of `f(7)`? Return an integer.", "reference_answer": "49", "estimated_seconds": 37.5, "metadata": {"generator": "_gen_t2_call", "tier": 0.25, "defn": "def f(x): return x * x", "call": "f(7)"}} |
| {"task_id": "code-42-0171", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 3 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 3 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 3 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 3}} |
| {"task_id": "code-42-0172", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 12 nodes {0, 1, \u2026, 11} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (0, 7), (1, 2), (1, 8), (1, 11), (2, 3), (2, 4), (2, 7), (2, 9), (3, 4), (3, 5), (3, 6), (3, 9), (4, 5), (4, 7), (4, 11), (5, 6), (5, 10), (6, 7), (6, 8), (6, 10), (7, 8), (7, 9), (7, 10), (7, 11), (8, 9), (8, 10), (8, 11), (9, 10), (9, 11), (10, 11)]\n\nHow many distinct directed paths are there from node 0 to node 11? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "98", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 12, "count": 98}} |
| {"task_id": "code-42-0173", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(38 * 14)\n\nReturn the printed value (an integer).", "reference_answer": "532", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 38, "b": 14, "op": "*"}} |
| {"task_id": "code-42-0174", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(28 - 37)\n\nReturn the printed value (an integer).", "reference_answer": "-9", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 28, "b": 37, "op": "-"}} |
| {"task_id": "code-42-0175", "family": "code", "difficulty": 0.4, "prompt": "What does the following Python snippet print?\n\n a = 8\n b = 2\n total = 0\n for i in range(1, 3 + 1):\n total += a * i - b\n print(total)\n\nReturn the integer that is printed.", "reference_answer": "42", "estimated_seconds": 51.0, "metadata": {"generator": "_gen_t3_snippet", "tier": 0.4, "snippet": "a = 8\nb = 2\ntotal = 0\nfor i in range(1, 3 + 1):\n total += a * i - b\nprint(total)"}} |
| {"task_id": "code-42-0176", "family": "code", "difficulty": 0.4, "prompt": "What does the following Python snippet print?\n\n a = 3\n b = 5\n total = 0\n for i in range(1, 1 + 1):\n total += a * i - b\n print(total)\n\nReturn the integer that is printed.", "reference_answer": "-2", "estimated_seconds": 51.0, "metadata": {"generator": "_gen_t3_snippet", "tier": 0.4, "snippet": "a = 3\nb = 5\ntotal = 0\nfor i in range(1, 1 + 1):\n total += a * i - b\nprint(total)"}} |
| {"task_id": "code-42-0177", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the sum of even numbers in `lst`.\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return sum(x for x in lst if x % 2 == 0)\n```", "reference_answer": "```python\ndef g(lst):\n return sum(x for x in lst if x % 2 == 0)\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 2}} |
| {"task_id": "code-42-0178", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(17 * 15)\n\nReturn the printed value (an integer).", "reference_answer": "255", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 17, "b": 15, "op": "*"}} |
| {"task_id": "code-42-0179", "family": "code", "difficulty": 0.25, "prompt": "Given the Python definition\n\n def f(x): return x ** 2 - x\n\nwhat is the value of `f(5)`? Return an integer.", "reference_answer": "20", "estimated_seconds": 37.5, "metadata": {"generator": "_gen_t2_call", "tier": 0.25, "defn": "def f(x): return x ** 2 - x", "call": "f(5)"}} |
| {"task_id": "code-42-0180", "family": "code", "difficulty": 0.85, "prompt": "The following Python function has a one-line bug:\n\n```python\ndef h(x):\n return x // 8 # BUG: should be x % 8\n```\n\nReply with the corrected function (just the def block, in a python code fence). Three calls of the form `h(x)` will be checked.", "reference_answer": "```python\ndef h(x):\n return x % 8\n```", "estimated_seconds": 91.5, "metadata": {"generator": "_gen_t6_bugfix", "tier": 0.85, "variant": 2}} |
| {"task_id": "code-42-0181", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 3 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 3 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 3 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 3}} |
| {"task_id": "code-42-0182", "family": "code", "difficulty": 0.25, "prompt": "Given the Python definition\n\n def f(x): return x ** 2 - x\n\nwhat is the value of `f(7)`? Return an integer.", "reference_answer": "42", "estimated_seconds": 37.5, "metadata": {"generator": "_gen_t2_call", "tier": 0.25, "defn": "def f(x): return x ** 2 - x", "call": "f(7)"}} |
| {"task_id": "code-42-0183", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 2 + 4\n def g(x): return x * x\n\nWhat is the integer value of `g(f(6))`?", "reference_answer": "256", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 2, "f_b": 4, "x": 6}} |
| {"task_id": "code-42-0184", "family": "code", "difficulty": 0.995, "prompt": "Consider a directed acyclic graph (DAG) on the 12 nodes {0, 1, \u2026, 11} with the following edge list (each edge u\u2192v points from a lower-numbered node to a higher-numbered node):\n\n edges = [(0, 1), (0, 3), (0, 7), (1, 2), (1, 4), (1, 7), (2, 3), (2, 7), (2, 9), (3, 4), (3, 8), (3, 10), (4, 5), (4, 7), (4, 10), (5, 6), (6, 7), (6, 9), (6, 10), (7, 8), (7, 9), (7, 11), (8, 9), (8, 10), (9, 10), (9, 11), (10, 11)]\n\nHow many distinct directed paths are there from node 0 to node 11? (Each path is a sequence of edges that begins at 0 and ends at n-1.) Return only the integer count.", "reference_answer": "76", "estimated_seconds": 104.55, "metadata": {"generator": "_gen_text_dag_paths", "tier": 0.995, "n": 12, "count": 76}} |
| {"task_id": "code-42-0185", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the index of the maximum element in `lst` (first occurrence; behavior undefined on empty).\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return lst.index(max(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return lst.index(max(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 3}} |
| {"task_id": "code-42-0186", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(17 * 12)\n\nReturn the printed value (an integer).", "reference_answer": "204", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 17, "b": 12, "op": "*"}} |
| {"task_id": "code-42-0187", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 7 + 2\n def g(x): return x * x\n\nWhat is the integer value of `g(f(6))`?", "reference_answer": "1936", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 7, "f_b": 2, "x": 6}} |
| {"task_id": "code-42-0188", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 2 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 2 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 2 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 2}} |
| {"task_id": "code-42-0189", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 7 + 1\n def g(x): return x * x\n\nWhat is the integer value of `g(f(7))`?", "reference_answer": "2500", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 7, "f_b": 1, "x": 7}} |
| {"task_id": "code-42-0190", "family": "code", "difficulty": 0.975, "prompt": "Count the number of distinct subsets of the following list of non-negative integers whose elements sum to exactly the given target. Two subsets are distinct if their index sets differ (the empty subset counts only if the target is 0). Return a single integer.\n\nList: [5, 5, 9, 3, 2, 12, 15, 14, 8, 1, 15]\nTarget: 44\n\nReturn only the integer count.", "reference_answer": "50", "estimated_seconds": 102.75, "metadata": {"generator": "_gen_text_dp_count", "tier": 0.975, "target": 44, "count": 50}} |
| {"task_id": "code-42-0191", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 2 + 1\n def g(x): return x * x\n\nWhat is the integer value of `g(f(10))`?", "reference_answer": "441", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 2, "f_b": 1, "x": 10}} |
| {"task_id": "code-42-0192", "family": "code", "difficulty": 0.25, "prompt": "Given the Python definition\n\n def f(x): return x * 2\n\nwhat is the value of `f(3)`? Return an integer.", "reference_answer": "6", "estimated_seconds": 37.5, "metadata": {"generator": "_gen_t2_call", "tier": 0.25, "defn": "def f(x): return x * 2", "call": "f(3)"}} |
| {"task_id": "code-42-0193", "family": "code", "difficulty": 0.7, "prompt": "Implement `g(lst)` that returns the sorted, deduplicated list (ascending).\n\nReply with a Python code block containing only the function definition. Example format:\n\n```python\ndef g(lst):\n return sorted(set(lst))\n```", "reference_answer": "```python\ndef g(lst):\n return sorted(set(lst))\n```", "estimated_seconds": 78.0, "metadata": {"generator": "_gen_t5_implement_algorithm", "tier": 0.7, "variant": 0}} |
| {"task_id": "code-42-0194", "family": "code", "difficulty": 0.95, "prompt": "Consider two Python functions:\n\n def f(x): return x * 2 + 4\n def g(x): return x * x\n\nWhat is the integer value of `g(f(11))`?", "reference_answer": "676", "estimated_seconds": 100.5, "metadata": {"generator": "_gen_t7_compose", "tier": 0.95, "f_a": 2, "f_b": 4, "x": 11}} |
| {"task_id": "code-42-0195", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 8 modulo 9. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=14, v=49), (w=8, v=46), (w=22, v=60), (w=21, v=31), (w=24, v=6), (w=7, v=18), (w=21, v=69), (w=3, v=46), (w=27, v=29), (w=8, v=8), (w=28, v=41)\nConstraint: total weight \u2261 8 (mod 9)\n\nReturn only the integer optimal total value.", "reference_answer": "379", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 9, "k": 8, "optimal": 379}} |
| {"task_id": "code-42-0196", "family": "code", "difficulty": 0.985, "prompt": "You are given a list of items, each with a weight w and a value v. Choose any subset of the items (each item at most once; no overall weight budget) so that the SUM OF WEIGHTS is congruent to 3 modulo 8. Among all such subsets, maximise the SUM OF VALUES. The empty subset (weight sum 0, value 0) is allowed; assume at least one valid subset exists.\n\nItems: (w=16, v=53), (w=18, v=60), (w=15, v=10), (w=21, v=40), (w=4, v=55), (w=29, v=15), (w=14, v=28), (w=22, v=56), (w=1, v=45), (w=9, v=44), (w=28, v=28), (w=7, v=26), (w=29, v=16)\nConstraint: total weight \u2261 3 (mod 8)\n\nReturn only the integer optimal total value.", "reference_answer": "445", "estimated_seconds": 103.65, "metadata": {"generator": "_gen_text_knapsack_mod", "tier": 0.985, "m": 8, "k": 3, "optimal": 445}} |
| {"task_id": "code-42-0197", "family": "code", "difficulty": 0.05, "prompt": "What does this Python statement print?\n\n print(5 + 40)\n\nReturn the printed value (an integer).", "reference_answer": "45", "estimated_seconds": 19.5, "metadata": {"generator": "_gen_t0_print", "tier": 0.05, "a": 5, "b": 40, "op": "+"}} |
| {"task_id": "code-42-0198", "family": "code", "difficulty": 0.55, "prompt": "Implement a Python function `f(x)` that returns `x * 5 + 1`. Reply with a Python code block containing only the function definition, e.g.:\n\n```python\ndef f(x):\n return x * 5 + 1\n```", "reference_answer": "```python\ndef f(x):\n return x * 5 + 1\n```", "estimated_seconds": 64.5, "metadata": {"generator": "_gen_t4_implement_simple", "tier": 0.55, "k": 5}} |
| {"task_id": "code-42-0199", "family": "code", "difficulty": 0.975, "prompt": "Count the number of distinct subsets of the following list of non-negative integers whose elements sum to exactly the given target. Two subsets are distinct if their index sets differ (the empty subset counts only if the target is 0). Return a single integer.\n\nList: [1, 3, 11, 5, 8, 10, 2, 15, 15, 3, 2]\nTarget: 48\n\nReturn only the integer count.", "reference_answer": "38", "estimated_seconds": 102.75, "metadata": {"generator": "_gen_text_dp_count", "tier": 0.975, "target": 48, "count": 38}} |
