task_id large_stringlengths 13 30 | text large_stringlengths 154 3.72k | domain large_stringclasses 1
value | task_family large_stringclasses 5
values | source large_stringclasses 3
values | interface_type large_stringclasses 2
values | tags large_stringclasses 1
value | prompt_view_mode large_stringclasses 1
value | label_cheap_fails bool 2
classes | label_medium_fails bool 2
classes | label_strong_fails bool 2
classes | label_big_model_needed bool 2
classes | label_best_route large_stringclasses 7
values | label_best_route_by_utility large_stringclasses 7
values | label_oracle_route large_stringclasses 7
values | outcome_difficulty_score float64 0 1 | label_recoverable_failure bool 2
classes | label_medium_recovers bool 2
classes | label_strong_recovers bool 2
classes | label_tool_recovers bool 1
class | label_best_recovery_route large_stringclasses 5
values | label_repair_needed bool 2
classes | label_repair_recovers bool 2
classes | recovery_routes large_stringclasses 25
values | label_hard_negative null | policy_id large_stringclasses 1
value | score_by_route dict | utility_by_route dict | latency_by_route dict | cost_by_route dict | label_metadata large_stringclasses 148
values | split large_stringclasses 1
value | group_id large_stringlengths 27 56 | template_id large_stringlengths 7 24 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
real::humaneval::humaneval-1 | from typing import List
def separate_paren_groups(paren_string: str) -> List[str]:
""" Input to this function is a string containing multiple groups of nested parentheses. Your goal is to
separate those group into separate strings and return the list of those.
Separate groups are balanced (each open brace... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 4115.049,
"code_specialist": 12247.417,
"code_specialist_repair": 13572.664,
"medium_model": 30749.898,
"strong_model": 8577.407,
"strong_repair": 14471.746,
"tool_route": 27.479
} | {
"cheap_model": 0.00001438,
"code_specialist": 0.000144,
"code_specialist_repair": 0.0001377,
"medium_model": 0.00004908,
"strong_model": 0.002058,
"strong_repair": 0.00185,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/1 | humaneval::HumanEval/1 |
real::humaneval::humaneval-3 | from typing import List
def below_zero(operations: List[int]) -> bool:
""" You're given a list of deposit and withdrawal operations on a bank account that starts with
zero balance. Your task is to detect if at any point the balance of account fallls below zero, and
at that point function should return Tru... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 3368.624,
"code_specialist": 2896.083,
"code_specialist_repair": 3845.716,
"medium_model": 1014.89,
"strong_model": 5661.643,
"strong_repair": 6246.264,
"tool_route": 34.641
} | {
"cheap_model": 0.00001242,
"code_specialist": 0.0000906,
"code_specialist_repair": 0.0000948,
"medium_model": 0.00003156,
"strong_model": 0.00095475,
"strong_repair": 0.00077075,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/3 | humaneval::HumanEval/3 |
real::humaneval::humaneval-5 | from typing import List
def intersperse(numbers: List[int], delimeter: int) -> List[int]:
""" Insert a number 'delimeter' between every two consecutive elements of input list `numbers'
>>> intersperse([], 4)
[]
>>> intersperse([1, 2, 3], 4)
[1, 4, 2, 4, 3]
"""
Return only the function in a si... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 205.059,
"code_specialist": 2950.558,
"code_specialist_repair": 4273.153,
"medium_model": 2016.142,
"strong_model": 6600.581,
"strong_repair": 9263.971,
"tool_route": 33.277
} | {
"cheap_model": 0.00001255,
"code_specialist": 0.000096,
"code_specialist_repair": 0.0000915,
"medium_model": 0.00003184,
"strong_model": 0.00098575,
"strong_repair": 0.00125175,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/5 | humaneval::HumanEval/5 |
real::humaneval::humaneval-6 | from typing import List
def parse_nested_parens(paren_string: str) -> List[int]:
""" Input to this function is a string represented multiple groups for nested parentheses separated by spaces.
For each of the group, output the deepest level of nesting of parentheses.
E.g. (()()) has maximum two levels of n... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 5938.058,
"code_specialist": 3714.671,
"code_specialist_repair": 4737.914,
"medium_model": 6520.882,
"strong_model": 11616.07,
"strong_repair": 8033.669,
"tool_route": 27.541
} | {
"cheap_model": 0.00001575,
"code_specialist": 0.0001464,
"code_specialist_repair": 0.0001713,
"medium_model": 0.00004942,
"strong_model": 0.00238275,
"strong_repair": 0.00144475,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/6 | humaneval::HumanEval/6 |
real::humaneval::humaneval-7 | from typing import List
def filter_by_substring(strings: List[str], substring: str) -> List[str]:
""" Filter an input list of strings only for ones that contain given substring
>>> filter_by_substring([], 'a')
[]
>>> filter_by_substring(['abc', 'bacd', 'cde', 'array'], 'a')
['abc', 'bacd', 'array'... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 4465.895,
"code_specialist": 3883.234,
"code_specialist_repair": 1540.283,
"medium_model": 1733.74,
"strong_model": 5046.32,
"strong_repair": 4987.037,
"tool_route": 34.698
} | {
"cheap_model": 0.0000152,
"code_specialist": 0.0001344,
"code_specialist_repair": 0.0000717,
"medium_model": 0.00002712,
"strong_model": 0.0008965,
"strong_repair": 0.0007945,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/7 | humaneval::HumanEval/7 |
real::humaneval::humaneval-8 | from typing import List, Tuple
def sum_product(numbers: List[int]) -> Tuple[int, int]:
""" For a given list of integers, return a tuple consisting of a sum and a product of all the integers in a list.
Empty sum should be equal to 0 and empty product should be equal to 1.
>>> sum_product([])
(0, 1)
... | coding | humaneval | humaneval | function_call | [] | prompt_only | true | false | false | true | medium_model | medium_model | medium_model | 1 | true | true | true | false | medium_model | false | false | ["code_specialist", "code_specialist_repair", "medium_model", "strong_model", "strong_repair"] | null | pol-644b522cec4e | {
"cheap_model": 0,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": -1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 999.797,
"code_specialist": 1287.271,
"code_specialist_repair": 8771.049,
"medium_model": 1225.081,
"strong_model": 4421.505,
"strong_repair": 5675.258,
"tool_route": 34.964
} | {
"cheap_model": 0.00001146,
"code_specialist": 0.0000972,
"code_specialist_repair": 0.0001923,
"medium_model": 0.0000314,
"strong_model": 0.00114275,
"strong_repair": 0.00086275,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/8 | humaneval::HumanEval/8 |
real::humaneval::humaneval-9 | from typing import List, Tuple
def rolling_max(numbers: List[int]) -> List[int]:
""" From a given list of integers, generate a list of rolling maximum element found until given moment
in the sequence.
>>> rolling_max([1, 2, 3, 2, 3, 4, 2])
[1, 2, 3, 3, 3, 4, 4]
"""
Return only the function in a s... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 3911.787,
"code_specialist": 7174.803,
"code_specialist_repair": 8243.573,
"medium_model": 2539.024,
"strong_model": 4657.622,
"strong_repair": 6675.97,
"tool_route": 33.234
} | {
"cheap_model": 0.00001219,
"code_specialist": 0.0000918,
"code_specialist_repair": 0.0000918,
"medium_model": 0.0000319,
"strong_model": 0.00084225,
"strong_repair": 0.00105625,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/9 | humaneval::HumanEval/9 |
real::humaneval::humaneval-10 | def is_palindrome(string: str) -> bool:
""" Test if given string is a palindrome """
return string == string[::-1]
def make_palindrome(string: str) -> str:
""" Find the shortest palindrome that begins with a supplied string.
Algorithm idea is simple:
- Find the longest postfix of supplied string t... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 1628.06,
"code_specialist": 15521.681,
"code_specialist_repair": 21839.345,
"medium_model": 3099.191,
"strong_model": 10322.242,
"strong_repair": 9540.771,
"tool_route": 29.502
} | {
"cheap_model": 0.00001554,
"code_specialist": 0.0001947,
"code_specialist_repair": 0.000201,
"medium_model": 0.00003578,
"strong_model": 0.00162225,
"strong_repair": 0.00162425,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/10 | humaneval::HumanEval/10 |
real::humaneval::humaneval-11 | from typing import List
def string_xor(a: str, b: str) -> str:
""" Input are two strings a and b consisting only of 1s and 0s.
Perform binary XOR on these inputs and return result also as a string.
>>> string_xor('010', '110')
'100'
"""
Return only the function in a single python code block. No e... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 4619.623,
"code_specialist": 6397.866,
"code_specialist_repair": 5815.325,
"medium_model": 3819.253,
"strong_model": 5121.756,
"strong_repair": 5177.433,
"tool_route": 27.893
} | {
"cheap_model": 0.00001395,
"code_specialist": 0.0000744,
"code_specialist_repair": 0.0000735,
"medium_model": 0.00002598,
"strong_model": 0.00088075,
"strong_repair": 0.00088875,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/11 | humaneval::HumanEval/11 |
real::humaneval::humaneval-14 | from typing import List
def all_prefixes(string: str) -> List[str]:
""" Return list of all prefixes from shortest to longest of the input string
>>> all_prefixes('abc')
['a', 'ab', 'abc']
"""
Return only the function in a single python code block. No explanation. | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 207.26,
"code_specialist": 5609.788,
"code_specialist_repair": 6765.451,
"medium_model": 1435.074,
"strong_model": 4378.044,
"strong_repair": 2961.796,
"tool_route": 26.71
} | {
"cheap_model": 0.00001202,
"code_specialist": 0.0000615,
"code_specialist_repair": 0.0000615,
"medium_model": 0.00002086,
"strong_model": 0.000698,
"strong_repair": 0.000528,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/14 | humaneval::HumanEval/14 |
real::humaneval::humaneval-17 | from typing import List
def parse_music(music_string: str) -> List[int]:
""" Input to this function is a string representing musical notes in a special ASCII format.
Your task is to parse this string and return list of integers corresponding to how many beats does each
not last.
Here is a legend:
... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 226.397,
"code_specialist": 4361.492,
"code_specialist_repair": 2664.288,
"medium_model": 3466.395,
"strong_model": 5962.149,
"strong_repair": 11314.926,
"tool_route": 35.117
} | {
"cheap_model": 0.00001678,
"code_specialist": 0.0001212,
"code_specialist_repair": 0.0001224,
"medium_model": 0.00004828,
"strong_model": 0.00147175,
"strong_repair": 0.00170975,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/17 | humaneval::HumanEval/17 |
real::humaneval::humaneval-18 | def how_many_times(string: str, substring: str) -> int:
""" Find how many times a given substring can be found in the original string. Count overlaping cases.
>>> how_many_times('', 'a')
0
>>> how_many_times('aaa', 'a')
3
>>> how_many_times('aaaa', 'aa')
3
"""
Return only the function i... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 970.299,
"code_specialist": 8123.745,
"code_specialist_repair": 11075.287,
"medium_model": 5094.069,
"strong_model": 6481.072,
"strong_repair": 4589.337,
"tool_route": 27.213
} | {
"cheap_model": 0.00001012,
"code_specialist": 0.0001008,
"code_specialist_repair": 0.000099,
"medium_model": 0.0000387,
"strong_model": 0.00092525,
"strong_repair": 0.00081925,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/18 | humaneval::HumanEval/18 |
real::humaneval::humaneval-20 | from typing import List, Tuple
def find_closest_elements(numbers: List[float]) -> Tuple[float, float]:
""" From a supplied list of numbers (of length at least two) select and return two that are the closest to each
other and return them in order (smaller number, larger number).
>>> find_closest_elements([... | coding | humaneval | humaneval | function_call | [] | prompt_only | true | false | false | true | medium_model | medium_model | medium_model | 1 | true | true | true | false | medium_model | false | false | ["code_specialist", "code_specialist_repair", "medium_model", "strong_model", "strong_repair"] | null | pol-644b522cec4e | {
"cheap_model": 0,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": -1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 363.106,
"code_specialist": 9932.368,
"code_specialist_repair": 2997.622,
"medium_model": 2603.293,
"strong_model": 5665.731,
"strong_repair": 8065.791,
"tool_route": 34.667
} | {
"cheap_model": 0.00002785,
"code_specialist": 0.0001788,
"code_specialist_repair": 0.0001638,
"medium_model": 0.0000514,
"strong_model": 0.00155525,
"strong_repair": 0.00132725,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/20 | humaneval::HumanEval/20 |
real::humaneval::humaneval-21 | from typing import List
def rescale_to_unit(numbers: List[float]) -> List[float]:
""" Given list of numbers (of at least two elements), apply a linear transform to that list,
such that the smallest number will become 0 and the largest will become 1
>>> rescale_to_unit([1.0, 2.0, 3.0, 4.0, 5.0])
[0.0, ... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 5979.275,
"code_specialist": 2490.231,
"code_specialist_repair": 9834.161,
"medium_model": 1790.887,
"strong_model": 5597.65,
"strong_repair": 7743.659,
"tool_route": 29.02
} | {
"cheap_model": 0.00001982,
"code_specialist": 0.0000966,
"code_specialist_repair": 0.0000975,
"medium_model": 0.00003398,
"strong_model": 0.0017105,
"strong_repair": 0.0013165,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/21 | humaneval::HumanEval/21 |
real::humaneval::humaneval-22 | from typing import List, Any
def filter_integers(values: List[Any]) -> List[int]:
""" Filter given list of any python values only for integers
>>> filter_integers(['a', 3.14, 5])
[5]
>>> filter_integers([1, 2, 3, 'abc', {}, []])
[1, 2, 3]
"""
Return only the function in a single python code b... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 2056.666,
"code_specialist": 5664.486,
"code_specialist_repair": 6900.255,
"medium_model": 868.382,
"strong_model": 9647.537,
"strong_repair": 8590.014,
"tool_route": 32.744
} | {
"cheap_model": 0.00000998,
"code_specialist": 0.0000687,
"code_specialist_repair": 0.0000687,
"medium_model": 0.00002374,
"strong_model": 0.00156475,
"strong_repair": 0.00126875,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/22 | humaneval::HumanEval/22 |
real::humaneval::humaneval-25 | from typing import List
def factorize(n: int) -> List[int]:
""" Return list of prime factors of given integer in the order from smallest to largest.
Each of the factors should be listed number of times corresponding to how many times it appeares in factorization.
Input number should be equal to the produc... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 4105.925,
"code_specialist": 9129.768,
"code_specialist_repair": 12050.489,
"medium_model": 1303.285,
"strong_model": 4111.667,
"strong_repair": 11473.846,
"tool_route": 26.885
} | {
"cheap_model": 0.00001485,
"code_specialist": 0.0001173,
"code_specialist_repair": 0.0001173,
"medium_model": 0.0000409,
"strong_model": 0.00111675,
"strong_repair": 0.00213075,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/25 | humaneval::HumanEval/25 |
real::humaneval::humaneval-26 | from typing import List
def remove_duplicates(numbers: List[int]) -> List[int]:
""" From a list of integers, remove all elements that occur more than once.
Keep order of elements left the same as in the input.
>>> remove_duplicates([1, 2, 3, 2, 4])
[1, 3, 4]
"""
Return only the function in a sing... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 2361.157,
"code_specialist": 4259.453,
"code_specialist_repair": 4174.588,
"medium_model": 12366.375,
"strong_model": 4338.124,
"strong_repair": 9863.383,
"tool_route": 29.131
} | {
"cheap_model": 0.00000944,
"code_specialist": 0.0001395,
"code_specialist_repair": 0.0001395,
"medium_model": 0.0000399,
"strong_model": 0.00091825,
"strong_repair": 0.00151825,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/26 | humaneval::HumanEval/26 |
real::humaneval::humaneval-27 | def flip_case(string: str) -> str:
""" For a given string, flip lowercase characters to uppercase and uppercase to lowercase.
>>> flip_case('Hello')
'hELLO'
"""
Return only the function in a single python code block. No explanation. | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 2819.524,
"code_specialist": 4498.563,
"code_specialist_repair": 823.558,
"medium_model": 593.323,
"strong_model": 3613.92,
"strong_repair": 3715.906,
"tool_route": 34.908
} | {
"cheap_model": 0.00000999,
"code_specialist": 0.0000861,
"code_specialist_repair": 0.0000441,
"medium_model": 0.00001782,
"strong_model": 0.00053725,
"strong_repair": 0.00045925,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/27 | humaneval::HumanEval/27 |
real::humaneval::humaneval-28 | from typing import List
def concatenate(strings: List[str]) -> str:
""" Concatenate list of strings into a single string
>>> concatenate([])
''
>>> concatenate(['a', 'b', 'c'])
'abc'
"""
Return only the function in a single python code block. No explanation. | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 200.164,
"code_specialist": 3289.611,
"code_specialist_repair": 13151.866,
"medium_model": 9442.591,
"strong_model": 3058.191,
"strong_repair": 8725.468,
"tool_route": 36.556
} | {
"cheap_model": 0.00001096,
"code_specialist": 0.0000906,
"code_specialist_repair": 0.0000915,
"medium_model": 0.00002984,
"strong_model": 0.0007715,
"strong_repair": 0.0015475,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/28 | humaneval::HumanEval/28 |
real::humaneval::humaneval-31 | def is_prime(n):
"""Return true if a given number is prime, and false otherwise.
>>> is_prime(6)
False
>>> is_prime(101)
True
>>> is_prime(11)
True
>>> is_prime(13441)
True
>>> is_prime(61)
True
>>> is_prime(4)
False
>>> is_prime(1)
False
"""
Return only ... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 2645.156,
"code_specialist": 3176.757,
"code_specialist_repair": 14794.18,
"medium_model": 1541.623,
"strong_model": 7285.409,
"strong_repair": 6668.319,
"tool_route": 29.154
} | {
"cheap_model": 0.00001166,
"code_specialist": 0.0001332,
"code_specialist_repair": 0.0001329,
"medium_model": 0.00004628,
"strong_model": 0.001284,
"strong_repair": 0.001194,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/31 | humaneval::HumanEval/31 |
real::humaneval::humaneval-32 | import math
def poly(xs: list, x: float):
"""
Evaluates polynomial with coefficients xs at point x.
return xs[0] + xs[1] * x + xs[1] * x^2 + .... xs[n] * x^n
"""
return sum([coeff * math.pow(x, i) for i, coeff in enumerate(xs)])
def find_zero(xs: list):
""" xs are coefficients of a polynomia... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 432.966,
"code_specialist": 17559.348,
"code_specialist_repair": 10448.896,
"medium_model": 1767.173,
"strong_model": 23015.527,
"strong_repair": 16002.154,
"tool_route": 25.198
} | {
"cheap_model": 0.00003562,
"code_specialist": 0.0004353,
"code_specialist_repair": 0.0004821,
"medium_model": 0.00003958,
"strong_model": 0.00437225,
"strong_repair": 0.00346425,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/32 | humaneval::HumanEval/32 |
real::humaneval::humaneval-33 | def sort_third(l: list):
"""This function takes a list l and returns a list l' such that
l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal
to the values of the corresponding indicies of l, but sorted.
>>> sort_thi... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 3274.976,
"code_specialist": 3218.032,
"code_specialist_repair": 3144.458,
"medium_model": 20224.92,
"strong_model": 7260.628,
"strong_repair": 10042.212,
"tool_route": 34.511
} | {
"cheap_model": 0.00001485,
"code_specialist": 0.0001386,
"code_specialist_repair": 0.0001431,
"medium_model": 0.0000513,
"strong_model": 0.0013095,
"strong_repair": 0.0018215,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/33 | humaneval::HumanEval/33 |
real::humaneval::humaneval-34 | def unique(l: list):
"""Return sorted unique elements in a list
>>> unique([5, 3, 5, 2, 3, 3, 9, 0, 123])
[0, 2, 3, 5, 9, 123]
"""
Return only the function in a single python code block. No explanation. | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 1463.932,
"code_specialist": 667.215,
"code_specialist_repair": 2596.643,
"medium_model": 843.803,
"strong_model": 4547.925,
"strong_repair": 5180.992,
"tool_route": 28.515
} | {
"cheap_model": 0.00000716,
"code_specialist": 0.0000471,
"code_specialist_repair": 0.0000468,
"medium_model": 0.00001714,
"strong_model": 0.0007035,
"strong_repair": 0.0008355,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/34 | humaneval::HumanEval/34 |
real::humaneval::humaneval-35 | def max_element(l: list):
"""Return maximum element in the list.
>>> max_element([1, 2, 3])
3
>>> max_element([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])
123
"""
Return only the function in a single python code block. No explanation. | coding | humaneval | humaneval | function_call | [] | prompt_only | true | false | false | true | medium_model | medium_model | medium_model | 1 | true | true | true | false | medium_model | false | false | ["code_specialist", "code_specialist_repair", "medium_model", "strong_model", "strong_repair"] | null | pol-644b522cec4e | {
"cheap_model": 0,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": -1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 604.738,
"code_specialist": 2762.368,
"code_specialist_repair": 619.57,
"medium_model": 6511.295,
"strong_model": 4661.149,
"strong_repair": 6607.407,
"tool_route": 27.711
} | {
"cheap_model": 0.0000067,
"code_specialist": 0.0001104,
"code_specialist_repair": 0.0000492,
"medium_model": 0.00001794,
"strong_model": 0.00094775,
"strong_repair": 0.00096575,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/35 | humaneval::HumanEval/35 |
real::humaneval::humaneval-37 | def sort_even(l: list):
"""This function takes a list l and returns a list l' such that
l' is identical to l in the odd indicies, while its values at the even indicies are equal
to the values of the even indicies of l, but sorted.
>>> sort_even([1, 2, 3])
[1, 2, 3]
>>> sort_even([5, 6, 3, 4])
... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 2747.925,
"code_specialist": 1538.052,
"code_specialist_repair": 5813.441,
"medium_model": 3014.467,
"strong_model": 7022.012,
"strong_repair": 6166.664,
"tool_route": 35.518
} | {
"cheap_model": 0.00001302,
"code_specialist": 0.0001197,
"code_specialist_repair": 0.0001446,
"medium_model": 0.00004646,
"strong_model": 0.001236,
"strong_repair": 0.001044,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/37 | humaneval::HumanEval/37 |
real::humaneval::humaneval-38 | def encode_cyclic(s: str):
"""
returns encoded string by cycling groups of three characters.
"""
# split string to groups. Each of length 3.
groups = [s[(3 * i):min((3 * i + 3), len(s))] for i in range((len(s) + 2) // 3)]
# cycle elements in each group. Unless group has fewer elements than 3.
... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 5681.309,
"code_specialist": 3141.737,
"code_specialist_repair": 1638.045,
"medium_model": 16067.959,
"strong_model": 6318.989,
"strong_repair": 5453.094,
"tool_route": 28.95
} | {
"cheap_model": 0.00002021,
"code_specialist": 0.0001554,
"code_specialist_repair": 0.0001542,
"medium_model": 0.00005402,
"strong_model": 0.001267,
"strong_repair": 0.000771,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/38 | humaneval::HumanEval/38 |
real::humaneval::humaneval-39 | def prime_fib(n: int):
"""
prime_fib returns n-th number that is a Fibonacci number and it's also prime.
>>> prime_fib(1)
2
>>> prime_fib(2)
3
>>> prime_fib(3)
5
>>> prime_fib(4)
13
>>> prime_fib(5)
89
"""
Return only the function in a single python code block. No ex... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 1106.049,
"code_specialist": 11609.365,
"code_specialist_repair": 5626.015,
"medium_model": 8135.274,
"strong_model": 17645.334,
"strong_repair": 15380.665,
"tool_route": 27.772
} | {
"cheap_model": 0.00001529,
"code_specialist": 0.0002469,
"code_specialist_repair": 0.0001992,
"medium_model": 0.000056,
"strong_model": 0.00368125,
"strong_repair": 0.00386125,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/39 | humaneval::HumanEval/39 |
real::humaneval::humaneval-40 | def triples_sum_to_zero(l: list):
"""
triples_sum_to_zero takes a list of integers as an input.
it returns True if there are three distinct elements in the list that
sum to zero, and False otherwise.
>>> triples_sum_to_zero([1, 3, 5, 0])
False
>>> triples_sum_to_zero([1, 3, -2, 1])
True... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 2385.66,
"code_specialist": 2851.808,
"code_specialist_repair": 1544.987,
"medium_model": 2616.365,
"strong_model": 8904.801,
"strong_repair": 8870.316,
"tool_route": 25.313
} | {
"cheap_model": 0.0000137,
"code_specialist": 0.0001668,
"code_specialist_repair": 0.000129,
"medium_model": 0.00004366,
"strong_model": 0.001383,
"strong_repair": 0.001825,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/40 | humaneval::HumanEval/40 |
real::humaneval::humaneval-41 | def car_race_collision(n: int):
"""
Imagine a road that's a perfectly straight infinitely long line.
n cars are driving left to right; simultaneously, a different set of n cars
are driving right to left. The two sets of cars start out being very far from
each other. All cars move in the same spe... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | false | false | false | cheap_model | cheap_model | cheap_model | 0 | false | null | null | null | null | false | false | [] | null | pol-644b522cec4e | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": 1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 1104.406,
"code_specialist": 2999.063,
"code_specialist_repair": 3531.605,
"medium_model": 1680.439,
"strong_model": 9020.362,
"strong_repair": 6363.232,
"tool_route": 32.695
} | {
"cheap_model": 0.0000109,
"code_specialist": 0.0000747,
"code_specialist_repair": 0.0000756,
"medium_model": 0.00002654,
"strong_model": 0.0013285,
"strong_repair": 0.0013785,
"tool_route": 0
} | {"cheap_route_id": "cheap_model", "difficulty_level": null, "errors_by_route": {"tool_route": "unsupported_tool_task"}, "hard_negative_injected": false, "hard_negative_type": null, "intended_level": null, "min_quality_for_success": 1.0, "missing_tier_routes": [], "n_routes": 7, "options": {"allow_subjective_labels": fa... | train | humaneval::coding::humaneval::humaneval::HumanEval/41 | humaneval::HumanEval/41 |
End of preview. Expand in Data Studio
Outcome router v1 code-slice training set
Code-only slice of the real_v1 corpus, 1,270 tasks (train 762, validation 191, test 317). Trains the repair-default, route-conditioned, pairwise, and domain-code routers.
Prompts and tests in the real sets come from TACO, APPS, MATH, GSM8K, MBPP, and HumanEval. They stay under those upstream terms. This archive does not relicense them. Outcome labels, costs, and latencies are measurements from this project. tasks.jsonl includes the hidden tests and reference solutions the checker used. The router input files do not include solver outputs.
Hugging Face dataset: https://huggingface.co/datasets/dhresearch/outcome-router-v1-v2code.
- Downloads last month
- 61