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 |
real::humaneval::humaneval-42 | def incr_list(l: list):
"""Return list with elements incremented by 1.
>>> incr_list([1, 2, 3])
[2, 3, 4]
>>> incr_list([5, 3, 5, 2, 3, 3, 9, 0, 123])
[6, 4, 6, 3, 4, 4, 10, 1, 124]
"""
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": 1260.639,
"code_specialist": 4509.762,
"code_specialist_repair": 1384.874,
"medium_model": 1252.583,
"strong_model": 5846.152,
"strong_repair": 4054.838,
"tool_route": 34.074
} | {
"cheap_model": 0.00000947,
"code_specialist": 0.0001539,
"code_specialist_repair": 0.000066,
"medium_model": 0.00002288,
"strong_model": 0.0007885,
"strong_repair": 0.0007165,
"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/42 | humaneval::HumanEval/42 |
real::humaneval::humaneval-44 | def change_base(x: int, base: int):
"""Change numerical base of input number x to base.
return string representation after the conversion.
base numbers are less than 10.
>>> change_base(8, 3)
'22'
>>> change_base(8, 2)
'1000'
>>> change_base(7, 2)
'111'
"""
Return only the funct... | 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": 3043.56,
"code_specialist": 4530.509,
"code_specialist_repair": 9424.587,
"medium_model": 10570.974,
"strong_model": 8275.087,
"strong_repair": 7032.015,
"tool_route": 33.227
} | {
"cheap_model": 0.0000115,
"code_specialist": 0.0001611,
"code_specialist_repair": 0.0001089,
"medium_model": 0.00003356,
"strong_model": 0.001088,
"strong_repair": 0.001258,
"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/44 | humaneval::HumanEval/44 |
real::humaneval::humaneval-47 | def median(l: list):
"""Return median of elements in the list l.
>>> median([3, 1, 2, 4, 5])
3
>>> median([-10, 4, 6, 1000, 10, 20])
15.0
"""
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": 3389.557,
"code_specialist": 7170.606,
"code_specialist_repair": 8537.375,
"medium_model": 12384.672,
"strong_model": 15626.256,
"strong_repair": 5032.899,
"tool_route": 26.95
} | {
"cheap_model": 0.00001134,
"code_specialist": 0.0000957,
"code_specialist_repair": 0.0000966,
"medium_model": 0.00003484,
"strong_model": 0.001906,
"strong_repair": 0.00102,
"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/47 | humaneval::HumanEval/47 |
real::humaneval::humaneval-49 | def modp(n: int, p: int):
"""Return 2^n modulo p (be aware of numerics).
>>> modp(3, 5)
3
>>> modp(1101, 101)
2
>>> modp(0, 101)
1
>>> modp(3, 11)
8
>>> modp(100, 101)
1
"""
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": 1207.001,
"code_specialist": 8187.629,
"code_specialist_repair": 8948.396,
"medium_model": 9026.967,
"strong_model": 6800.372,
"strong_repair": 10928.383,
"tool_route": 30.172
} | {
"cheap_model": 0.00000924,
"code_specialist": 0.0001872,
"code_specialist_repair": 0.0001116,
"medium_model": 0.00002408,
"strong_model": 0.00111575,
"strong_repair": 0.00257375,
"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/49 | humaneval::HumanEval/49 |
real::humaneval::humaneval-54 | def same_chars(s0: str, s1: str):
"""
Check if two words have the same characters.
>>> same_chars('eabcdzzzz', 'dddzzzzzzzddeddabc')
True
>>> same_chars('abcd', 'dddddddabc')
True
>>> same_chars('dddddddabc', 'abcd')
True
>>> same_chars('eabcd', 'dddddddabc')
False
>>> same_c... | 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": 7130.937,
"code_specialist": 2244.247,
"code_specialist_repair": 4980.378,
"medium_model": 5274.039,
"strong_model": 5879.08,
"strong_repair": 4317.272,
"tool_route": 36.665
} | {
"cheap_model": 0.00002115,
"code_specialist": 0.0000813,
"code_specialist_repair": 0.0000825,
"medium_model": 0.00002854,
"strong_model": 0.00112375,
"strong_repair": 0.00104175,
"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/54 | humaneval::HumanEval/54 |
real::humaneval::humaneval-55 | def fib(n: int):
"""Return n-th Fibonacci number.
>>> fib(10)
55
>>> fib(1)
1
>>> fib(8)
21
"""
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": 2875.465,
"code_specialist": 2766.843,
"code_specialist_repair": 3634.018,
"medium_model": 1300.182,
"strong_model": 7132.834,
"strong_repair": 6535.488,
"tool_route": 27.552
} | {
"cheap_model": 0.00000851,
"code_specialist": 0.0001128,
"code_specialist_repair": 0.0001107,
"medium_model": 0.00002592,
"strong_model": 0.00144825,
"strong_repair": 0.00116425,
"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/55 | humaneval::HumanEval/55 |
real::humaneval::humaneval-56 | def correct_bracketing(brackets: str):
""" brackets is a string of "<" and ">".
return True if every opening bracket has a corresponding closing bracket.
>>> correct_bracketing("<")
False
>>> correct_bracketing("<>")
True
>>> correct_bracketing("<<><>>")
True
>>> correct_bracketing(... | 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": 1272.569,
"code_specialist": 4412.355,
"code_specialist_repair": 2703.169,
"medium_model": 1545.144,
"strong_model": 4485.964,
"strong_repair": 3441.243,
"tool_route": 26.837
} | {
"cheap_model": 0.00001152,
"code_specialist": 0.0001029,
"code_specialist_repair": 0.0001032,
"medium_model": 0.00003502,
"strong_model": 0.0008185,
"strong_repair": 0.0008505,
"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/56|n2 | humaneval::HumanEval/56 |
real::humaneval::humaneval-57 | def monotonic(l: list):
"""Return True is list elements are monotonically increasing or decreasing.
>>> monotonic([1, 2, 4, 20])
True
>>> monotonic([1, 20, 4, 10])
False
>>> monotonic([4, 1, 0, -10])
True
"""
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": 873.031,
"code_specialist": 7721.039,
"code_specialist_repair": 2387.965,
"medium_model": 3681.598,
"strong_model": 4513.949,
"strong_repair": 4641.429,
"tool_route": 25.741
} | {
"cheap_model": 0.00001103,
"code_specialist": 0.0000912,
"code_specialist_repair": 0.0000924,
"medium_model": 0.00003572,
"strong_model": 0.00100275,
"strong_repair": 0.00118275,
"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/57 | humaneval::HumanEval/57 |
real::humaneval::humaneval-60 | def sum_to_n(n: int):
"""sum_to_n is a function that sums numbers from 1 to n.
>>> sum_to_n(30)
465
>>> sum_to_n(100)
5050
>>> sum_to_n(5)
15
>>> sum_to_n(10)
55
>>> sum_to_n(1)
1
"""
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": 704.553,
"code_specialist": 2639.184,
"code_specialist_repair": 2569.635,
"medium_model": 10189.757,
"strong_model": 4659.603,
"strong_repair": 4785.217,
"tool_route": 34.049
} | {
"cheap_model": 0.0000089,
"code_specialist": 0.0000606,
"code_specialist_repair": 0.0001293,
"medium_model": 0.0000233,
"strong_model": 0.00095675,
"strong_repair": 0.00090075,
"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/60 | humaneval::HumanEval/60 |
real::humaneval::humaneval-61 | def correct_bracketing(brackets: str):
""" brackets is a string of "(" and ")".
return True if every opening bracket has a corresponding closing bracket.
>>> correct_bracketing("(")
False
>>> correct_bracketing("()")
True
>>> correct_bracketing("(()())")
True
>>> correct_bracketing(... | 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": 1559.743,
"code_specialist": 2134.92,
"code_specialist_repair": 3035.305,
"medium_model": 10150.042,
"strong_model": 5013.708,
"strong_repair": 3112.659,
"tool_route": 31.412
} | {
"cheap_model": 0.00000836,
"code_specialist": 0.0001023,
"code_specialist_repair": 0.0001011,
"medium_model": 0.00003272,
"strong_model": 0.000944,
"strong_repair": 0.000802,
"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/56|n2 | humaneval::HumanEval/61 |
real::humaneval::humaneval-63 | def fibfib(n: int):
"""The FibFib number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
fibfib(0) == 0
fibfib(1) == 0
fibfib(2) == 1
fibfib(n) == fibfib(n-1) + fibfib(n-2) + fibfib(n-3).
Please write a function to efficiently compute the n-th element of the ... | 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.386,
"code_specialist": 11615.855,
"code_specialist_repair": 2896.439,
"medium_model": 1083.385,
"strong_model": 12918.861,
"strong_repair": 10123.424,
"tool_route": 29.447
} | {
"cheap_model": 0.00001852,
"code_specialist": 0.000135,
"code_specialist_repair": 0.0001362,
"medium_model": 0.00005034,
"strong_model": 0.003034,
"strong_repair": 0.003252,
"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/63 | humaneval::HumanEval/63 |
real::humaneval::humaneval-64 | FIX = """
Add more test cases.
"""
def vowels_count(s):
"""Write a function vowels_count which takes a string representing
a word as input and returns the number of vowels in the string.
Vowels in this case are 'a', 'e', 'i', 'o', 'u'. Here, 'y' is also a
vowel, but only when it is at the end of the gi... | 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": 2523.118,
"code_specialist": 5076.31,
"code_specialist_repair": 5665.682,
"medium_model": 4903.96,
"strong_model": 6986.582,
"strong_repair": 6018.469,
"tool_route": 25.984
} | {
"cheap_model": 0.00001221,
"code_specialist": 0.0001161,
"code_specialist_repair": 0.0001125,
"medium_model": 0.00003396,
"strong_model": 0.0015305,
"strong_repair": 0.0016205,
"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/64 | humaneval::HumanEval/64 |
real::humaneval::humaneval-66 | def digitSum(s):
"""Task
Write a function that takes a string as input and returns the sum of the upper characters only'
ASCII codes.
Examples:
digitSum("") => 0
digitSum("abAB") => 131
digitSum("abcCd") => 67
digitSum("helloE") => 69
digitSum("woArBld") => 131
... | 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": 725.401,
"code_specialist": 3337.883,
"code_specialist_repair": 3461.78,
"medium_model": 6258.598,
"strong_model": 5880.355,
"strong_repair": 5697.699,
"tool_route": 36.859
} | {
"cheap_model": 0.0000098,
"code_specialist": 0.0000669,
"code_specialist_repair": 0.0000669,
"medium_model": 0.0000235,
"strong_model": 0.000915,
"strong_repair": 0.000991,
"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/66 | humaneval::HumanEval/66 |
real::humaneval::humaneval-67 | def fruit_distribution(s,n):
"""
In this task, you will be given a string that represents a number of apples and oranges
that are distributed in a basket of fruit this basket contains
apples, oranges, and mango fruits. Given the string that represents the total number of
the oranges and apples and a... | 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": 302.412,
"code_specialist": 1247.094,
"code_specialist_repair": 3396.548,
"medium_model": 2404.789,
"strong_model": 5245.2,
"strong_repair": 4719.848,
"tool_route": 30.293
} | {
"cheap_model": 0.00002565,
"code_specialist": 0.0001275,
"code_specialist_repair": 0.0001239,
"medium_model": 0.00004098,
"strong_model": 0.00110775,
"strong_repair": 0.00092175,
"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/67 | humaneval::HumanEval/67 |
real::humaneval::humaneval-69 | def search(lst):
'''
You are given a non-empty list of positive integers. Return the greatest integer that is greater than
zero, and has a frequency greater than or equal to the value of the integer itself.
The frequency of an integer is the number of times it appears in the list.
If no such a value... | 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": 4433.181,
"code_specialist": 7982.444,
"code_specialist_repair": 6539.717,
"medium_model": 4677.115,
"strong_model": 3072.248,
"strong_repair": 5699.923,
"tool_route": 36.448
} | {
"cheap_model": 0.00001667,
"code_specialist": 0.0001194,
"code_specialist_repair": 0.0001122,
"medium_model": 0.00004662,
"strong_model": 0.00073825,
"strong_repair": 0.00156825,
"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/69 | humaneval::HumanEval/69 |
real::humaneval::humaneval-73 | def smallest_change(arr):
"""
Given an array arr of integers, find the minimum number of elements that
need to be changed to make the array palindromic. A palindromic array is an array that
is read the same backwards and forwards. In one change, you can change one element to any other element.
For ... | 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": 349.086,
"code_specialist": 1870.546,
"code_specialist_repair": 8451.123,
"medium_model": 5302.718,
"strong_model": 4535.38,
"strong_repair": 4627.47,
"tool_route": 28.002
} | {
"cheap_model": 0.00002068,
"code_specialist": 0.0001077,
"code_specialist_repair": 0.0001218,
"medium_model": 0.00004176,
"strong_model": 0.0009105,
"strong_repair": 0.0012485,
"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/73 | humaneval::HumanEval/73 |
real::humaneval::humaneval-75 | def is_multiply_prime(a):
"""Write a function that returns true if the given number is the multiplication of 3 prime numbers
and false otherwise.
Knowing that (a) is less then 100.
Example:
is_multiply_prime(30) == True
30 = 2 * 3 * 5
"""
Return only the function in a single python code blo... | 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": 5345.664,
"code_specialist": 16210.231,
"code_specialist_repair": 10091.128,
"medium_model": 2322.052,
"strong_model": 7447.296,
"strong_repair": 6578.157,
"tool_route": 31.654
} | {
"cheap_model": 0.00001289,
"code_specialist": 0.0001611,
"code_specialist_repair": 0.0001656,
"medium_model": 0.00007332,
"strong_model": 0.00162325,
"strong_repair": 0.00164325,
"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/75 | humaneval::HumanEval/75 |
real::humaneval::humaneval-77 | def iscube(a):
'''
Write a function that takes an integer a and returns True
if this ingeger is a cube of some integer number.
Note: you may assume the input is always valid.
Examples:
iscube(1) ==> True
iscube(2) ==> False
iscube(-1) ==> True
iscube(64) ==> True
iscube(0) ==> Tr... | 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": 1107.303,
"code_specialist": 2907.76,
"code_specialist_repair": 1054.332,
"medium_model": 7334.543,
"strong_model": 7525.37,
"strong_repair": 8379.366,
"tool_route": 33.219
} | {
"cheap_model": 0.00000933,
"code_specialist": 0.0000915,
"code_specialist_repair": 0.0000837,
"medium_model": 0.00003194,
"strong_model": 0.00213275,
"strong_repair": 0.00190475,
"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/77 | humaneval::HumanEval/77 |
real::humaneval::humaneval-78 | def hex_key(num):
"""You have been tasked to write a function that receives
a hexadecimal number as a string and counts the number of hexadecimal
digits that are primes (prime number, or a prime, is a natural number
greater than 1 that is not a product of two smaller natural numbers).
Hexadecimal di... | 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": 6710.498,
"code_specialist": 8303.844,
"code_specialist_repair": 7171.687,
"medium_model": 1646.568,
"strong_model": 5066.868,
"strong_repair": 5865.097,
"tool_route": 32.162
} | {
"cheap_model": 0.00002932,
"code_specialist": 0.0001518,
"code_specialist_repair": 0.0001518,
"medium_model": 0.0000485,
"strong_model": 0.0010455,
"strong_repair": 0.0017515,
"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/78 | humaneval::HumanEval/78 |
real::humaneval::humaneval-79 | def decimal_to_binary(decimal):
"""You will be given a number in decimal form and your task is to convert it to
binary format. The function should return a string, with each character representing a binary
number. Each character in the string will be '0' or '1'.
There will be an extra couple of charact... | 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": 3043.386,
"code_specialist": 3330.772,
"code_specialist_repair": 4012.357,
"medium_model": 1330.018,
"strong_model": 4715.368,
"strong_repair": 9078.919,
"tool_route": 35.808
} | {
"cheap_model": 0.00001155,
"code_specialist": 0.0001245,
"code_specialist_repair": 0.0000822,
"medium_model": 0.0000279,
"strong_model": 0.001182,
"strong_repair": 0.001664,
"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/79 | humaneval::HumanEval/79 |
real::humaneval::humaneval-81 | def numerical_letter_grade(grades):
"""It is the last week of the semester and the teacher has to give the grades
to students. The teacher has been making her own algorithm for grading.
The only problem is, she has lost the code she used for grading.
She has given you a list of GPAs for some students an... | 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": 9352.316,
"code_specialist": 5521.045,
"code_specialist_repair": 2783.359,
"medium_model": 37013.66,
"strong_model": 7063.84,
"strong_repair": 8151.552,
"tool_route": 31.267
} | {
"cheap_model": 0.00003387,
"code_specialist": 0.000333,
"code_specialist_repair": 0.0003039,
"medium_model": 0.00011206,
"strong_model": 0.00206425,
"strong_repair": 0.00228625,
"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/81 | humaneval::HumanEval/81 |
real::humaneval::humaneval-83 | def starts_one_ends(n):
"""
Given a positive integer n, return the count of the numbers of n-digit
positive integers that start or end with 1.
"""
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": 945.257,
"code_specialist": 11386.603,
"code_specialist_repair": 4808.114,
"medium_model": 5847.428,
"strong_model": 7000.291,
"strong_repair": 9168.402,
"tool_route": 25.712
} | {
"cheap_model": 0.0000084,
"code_specialist": 0.0000765,
"code_specialist_repair": 0.0001545,
"medium_model": 0.00003822,
"strong_model": 0.0017145,
"strong_repair": 0.0022005,
"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/83 | humaneval::HumanEval/83 |
real::humaneval::humaneval-85 | def add(lst):
"""Given a non-empty list of integers lst. add the even elements that are at odd indices..
Examples:
add([4, 2, 6, 7]) ==> 2
"""
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": 332.245,
"code_specialist": 1847.045,
"code_specialist_repair": 4777.731,
"medium_model": 1456.082,
"strong_model": 3828.237,
"strong_repair": 3648.329,
"tool_route": 32.142
} | {
"cheap_model": 0.00000894,
"code_specialist": 0.0000615,
"code_specialist_repair": 0.0000612,
"medium_model": 0.00002206,
"strong_model": 0.001083,
"strong_repair": 0.000743,
"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/85 | humaneval::HumanEval/85 |
real::humaneval::humaneval-87 | def get_row(lst, x):
"""
You are given a 2 dimensional data, as a nested lists,
which is similar to matrix, however, unlike matrices,
each row may contain a different number of columns.
Given lst, and integer x, find integers x in the list,
and return list of tuples, [(x1, y1), (x2, y2) ...] suc... | 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": 2467.764,
"code_specialist": 3553.566,
"code_specialist_repair": 2262.893,
"medium_model": 2613.694,
"strong_model": 4085.53,
"strong_repair": 6022.538,
"tool_route": 29.071
} | {
"cheap_model": 0.00001953,
"code_specialist": 0.0001539,
"code_specialist_repair": 0.0001443,
"medium_model": 0.0000513,
"strong_model": 0.00096575,
"strong_repair": 0.00105575,
"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/87 | humaneval::HumanEval/87 |
real::humaneval::humaneval-88 | def sort_array(array):
"""
Given an array of non-negative integers, return a copy of the given array after sorting,
you will sort the given array in ascending order if the sum( first index value, last index value) is odd,
or sort it in descending order if the sum( first index value, last index value) is... | 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": 3580.109,
"code_specialist": 9000.744,
"code_specialist_repair": 9918.632,
"medium_model": 2056.408,
"strong_model": 5900.288,
"strong_repair": 6129.902,
"tool_route": 27.634
} | {
"cheap_model": 0.00001582,
"code_specialist": 0.0001353,
"code_specialist_repair": 0.0001353,
"medium_model": 0.00004388,
"strong_model": 0.00142775,
"strong_repair": 0.00114175,
"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/88 | humaneval::HumanEval/88 |
real::humaneval::humaneval-90 | def next_smallest(lst):
"""
You are given a list of integers.
Write a function next_smallest() that returns the 2nd smallest element of the list.
Return None if there is no such element.
next_smallest([1, 2, 3, 4, 5]) == 2
next_smallest([5, 1, 4, 3, 2]) == 2
next_smallest([]) == None
ne... | 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": 2189.756,
"code_specialist": 7059.557,
"code_specialist_repair": 4063.154,
"medium_model": 1804.565,
"strong_model": 4897.042,
"strong_repair": 9047.681,
"tool_route": 32.744
} | {
"cheap_model": 0.00001046,
"code_specialist": 0.0000978,
"code_specialist_repair": 0.000141,
"medium_model": 0.00003366,
"strong_model": 0.000938,
"strong_repair": 0.001398,
"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/90 | humaneval::HumanEval/90 |
real::humaneval::humaneval-91 | def is_bored(S):
"""
You'll be given a string of words, and your task is to count the number
of boredoms. A boredom is a sentence that starts with the word "I".
Sentences are delimited by '.', '?' or '!'.
For example:
>>> is_bored("Hello world")
0
>>> is_bored("The sky is blue. The sun ... | 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": 203.698,
"code_specialist": 16438.169,
"code_specialist_repair": 10203.986,
"medium_model": 5267.159,
"strong_model": 5143.448,
"strong_repair": 13207.086,
"tool_route": 31.677
} | {
"cheap_model": 0.00001245,
"code_specialist": 0.0001677,
"code_specialist_repair": 0.0001056,
"medium_model": 0.00003026,
"strong_model": 0.00135975,
"strong_repair": 0.00248175,
"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/91 | humaneval::HumanEval/91 |
real::humaneval::humaneval-92 | def any_int(x, y, z):
'''
Create a function that takes 3 numbers.
Returns true if one of the numbers is equal to the sum of the other two, and all numbers are integers.
Returns false in any other cases.
Examples
any_int(5, 2, 7) ➞ True
any_int(3, 2, 2) ➞ False
any_int(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": 2829.318,
"code_specialist": 8025.278,
"code_specialist_repair": 7722.745,
"medium_model": 11674.074,
"strong_model": 5307.24,
"strong_repair": 7155.306,
"tool_route": 32.394
} | {
"cheap_model": 0.00001299,
"code_specialist": 0.0001017,
"code_specialist_repair": 0.0001017,
"medium_model": 0.00003702,
"strong_model": 0.00116425,
"strong_repair": 0.00124025,
"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/92 | humaneval::HumanEval/92 |
real::humaneval::humaneval-93 | def encode(message):
"""
Write a function that takes a message, and encodes in such a
way that it swaps case of all letters, replaces all vowels in
the message with the letter that appears 2 places ahead of that
vowel in the english alphabet.
Assume only letters.
Examples:
>>> encode('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": 976.342,
"code_specialist": 1905.354,
"code_specialist_repair": 10376.434,
"medium_model": 17637.031,
"strong_model": 17845.354,
"strong_repair": 19775.313,
"tool_route": 27.153
} | {
"cheap_model": 0.00001251,
"code_specialist": 0.0001326,
"code_specialist_repair": 0.0001512,
"medium_model": 0.0000582,
"strong_model": 0.004364,
"strong_repair": 0.003246,
"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/93 | humaneval::HumanEval/93 |
real::humaneval::humaneval-94 | def skjkasdkd(lst):
"""You are given a list of integers.
You need to find the largest prime value and return the sum of its digits.
Examples:
For lst = [0,3,2,1,3,5,7,4,5,5,5,2,181,32,4,32,3,2,32,324,4,3] the output should be 10
For lst = [1,0,1,8,2,4597,2,1,3,40,1,2,1,2,4,2,5,1] the output should ... | 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": 1310.348,
"code_specialist": 2915.29,
"code_specialist_repair": 2874.572,
"medium_model": 8353.942,
"strong_model": 7794.291,
"strong_repair": 12169.475,
"tool_route": 35.684
} | {
"cheap_model": 0.00002378,
"code_specialist": 0.0001992,
"code_specialist_repair": 0.0002064,
"medium_model": 0.00006852,
"strong_model": 0.0022565,
"strong_repair": 0.0022845,
"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/94 | humaneval::HumanEval/94 |
real::humaneval::humaneval-97 | def multiply(a, b):
"""Complete the function that takes two integers and returns
the product of their unit digits.
Assume the input is always valid.
Examples:
multiply(148, 412) should return 16.
multiply(19, 28) should return 72.
multiply(2020, 1851) should return 0.
multiply(14,-15) sh... | 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": 804.394,
"code_specialist": 4283.283,
"code_specialist_repair": 4436.813,
"medium_model": 1182.026,
"strong_model": 3263.536,
"strong_repair": 6152.251,
"tool_route": 30.821
} | {
"cheap_model": 0.00000918,
"code_specialist": 0.000066,
"code_specialist_repair": 0.000066,
"medium_model": 0.0000238,
"strong_model": 0.00083175,
"strong_repair": 0.00095775,
"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/97 | humaneval::HumanEval/97 |
real::humaneval::humaneval-100 | def make_a_pile(n):
"""
Given a positive integer n, you have to make a pile of n levels of stones.
The first level has n stones.
The number of stones in the next level is:
- the next odd number if n is odd.
- the next even number if n is even.
Return the number of stones in each leve... | 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": 1006.506,
"code_specialist": 3964.155,
"code_specialist_repair": 5558.122,
"medium_model": 10238.497,
"strong_model": 3584.138,
"strong_repair": 6012.912,
"tool_route": 28.364
} | {
"cheap_model": 0.00001488,
"code_specialist": 0.0001095,
"code_specialist_repair": 0.0002193,
"medium_model": 0.00004438,
"strong_model": 0.00090425,
"strong_repair": 0.00119625,
"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/100 | humaneval::HumanEval/100 |
real::humaneval::humaneval-101 | def words_string(s):
"""
You will be given a string of words separated by commas or spaces. Your task is
to split the string into words and return an array of the words.
For example:
words_string("Hi, my name is John") == ["Hi", "my", "name", "is", "John"]
words_string("One, two, three, four, f... | 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": 875.376,
"code_specialist": 5306.406,
"code_specialist_repair": 4447.878,
"medium_model": 3419.51,
"strong_model": 3741.404,
"strong_repair": 6139.916,
"tool_route": 26.628
} | {
"cheap_model": 0.00000947,
"code_specialist": 0.0000693,
"code_specialist_repair": 0.0000711,
"medium_model": 0.00002188,
"strong_model": 0.000594,
"strong_repair": 0.000884,
"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/101 | humaneval::HumanEval/101 |
real::humaneval::humaneval-102 | def choose_num(x, y):
"""This function takes two positive numbers x and y and returns the
biggest even integer number that is in the range [x, y] inclusive. If
there's no such number, then the function should return -1.
For example:
choose_num(12, 15) = 14
choose_num(13, 12) = -1
"""
Retur... | 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": 4025.385,
"code_specialist": 2610.695,
"code_specialist_repair": 5111.061,
"medium_model": 9322.548,
"strong_model": 10958.056,
"strong_repair": 12107.809,
"tool_route": 29.49
} | {
"cheap_model": 0.00001181,
"code_specialist": 0.0001029,
"code_specialist_repair": 0.0001029,
"medium_model": 0.00003554,
"strong_model": 0.0022765,
"strong_repair": 0.0024365,
"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/102 | humaneval::HumanEval/102 |
real::humaneval::humaneval-103 | def rounded_avg(n, m):
"""You are given two positive integers n and m, and your task is to compute the
average of the integers from n through m (including n and m).
Round the answer to the nearest integer and convert that to binary.
If n is greater than m, return -1.
Example:
rounded_avg(1, 5) =... | 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": 2464.804,
"code_specialist": 6454.408,
"code_specialist_repair": 9640.73,
"medium_model": 10515.616,
"strong_model": 9083.844,
"strong_repair": 15002.47,
"tool_route": 30.97
} | {
"cheap_model": 0.00001262,
"code_specialist": 0.0001005,
"code_specialist_repair": 0.0001131,
"medium_model": 0.00003388,
"strong_model": 0.00249,
"strong_repair": 0.00214,
"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/103 | humaneval::HumanEval/103 |
real::humaneval::humaneval-106 | def f(n):
""" Implement the function f that takes n as a parameter,
and returns a list of size n, such that the value of the element at index i is the factorial of i if i is even
or the sum of numbers from 1 to i otherwise.
i starts from 1.
the factorial of i is the multiplication of the numbers fro... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | true | 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": 0,
"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": 2408.763,
"code_specialist": 5638.865,
"code_specialist_repair": 14687.149,
"medium_model": 1541.101,
"strong_model": 6883.777,
"strong_repair": 8321.825,
"tool_route": 35.578
} | {
"cheap_model": 0.00001155,
"code_specialist": 0.0001395,
"code_specialist_repair": 0.0001476,
"medium_model": 0.00004878,
"strong_model": 0.00167025,
"strong_repair": 0.00137625,
"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/106 | humaneval::HumanEval/106 |
real::humaneval::humaneval-107 | def even_odd_palindrome(n):
"""
Given a positive integer n, return a tuple that has the number of even and odd
integer palindromes that fall within the range(1, n), inclusive.
Example 1:
Input: 3
Output: (1, 2)
Explanation:
Integer palindrome are 1, 2, 3. one of them is... | 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": 1221.374,
"code_specialist": 9808.588,
"code_specialist_repair": 12409.463,
"medium_model": 2928.226,
"strong_model": 5003.312,
"strong_repair": 7193.669,
"tool_route": 32.531
} | {
"cheap_model": 0.00002035,
"code_specialist": 0.0001551,
"code_specialist_repair": 0.0001524,
"medium_model": 0.00005334,
"strong_model": 0.00147575,
"strong_repair": 0.00164175,
"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/107 | humaneval::HumanEval/107 |
real::humaneval::humaneval-108 | def count_nums(arr):
"""
Write a function count_nums which takes an array of integers and returns
the number of elements which has a sum of digits > 0.
If a number is negative, then its first signed digit will be negative:
e.g. -123 has signed digits -1, 2, and 3.
>>> count_nums([]) == 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": 1799.869,
"code_specialist": 11573.325,
"code_specialist_repair": 13370.688,
"medium_model": 14263.565,
"strong_model": 7592.738,
"strong_repair": 10757.07,
"tool_route": 25.584
} | {
"cheap_model": 0.00001123,
"code_specialist": 0.0001386,
"code_specialist_repair": 0.0001368,
"medium_model": 0.00004262,
"strong_model": 0.00142025,
"strong_repair": 0.00191625,
"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/108 | humaneval::HumanEval/108 |
real::humaneval::humaneval-109 | def move_one_ball(arr):
"""We have an array 'arr' of N integers arr[1], arr[2], ..., arr[N].The
numbers in the array will be randomly ordered. Your task is to determine if
it is possible to get an array sorted in non-decreasing order by performing
the following operation on the given array:
You ... | 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": 1188.64,
"code_specialist": 9767.643,
"code_specialist_repair": 3171.336,
"medium_model": 1077.089,
"strong_model": 8848.472,
"strong_repair": 9048.202,
"tool_route": 31.324
} | {
"cheap_model": 0.00002143,
"code_specialist": 0.0001824,
"code_specialist_repair": 0.0002124,
"medium_model": 0.00004948,
"strong_model": 0.0018335,
"strong_repair": 0.0012675,
"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/109 | humaneval::HumanEval/109 |
real::humaneval::humaneval-110 | def exchange(lst1, lst2):
"""In this problem, you will implement a function that takes two lists of numbers,
and determines whether it is possible to perform an exchange of elements
between them to make lst1 a list of only even numbers.
There is no limit on the number of exchanged elements between lst1 ... | 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": 553.074,
"code_specialist": 3415.186,
"code_specialist_repair": 2641.694,
"medium_model": 23993.072,
"strong_model": 11325.159,
"strong_repair": 28290.571,
"tool_route": 31.828
} | {
"cheap_model": 0.0000234,
"code_specialist": 0.0001425,
"code_specialist_repair": 0.0001428,
"medium_model": 0.00006432,
"strong_model": 0.0020245,
"strong_repair": 0.0054025,
"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/110 | humaneval::HumanEval/110 |
real::humaneval::humaneval-111 | def histogram(test):
"""Given a string representing a space separated lowercase letters, return a dictionary
of the letter with the most repetition and containing the corresponding count.
If several letters have the same occurrence, return all of them.
Example:
histogram('a b c') == {'a': 1, 'b': 1... | 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": 878.681,
"code_specialist": 4015.671,
"code_specialist_repair": 4905.089,
"medium_model": 860.514,
"strong_model": 7360.027,
"strong_repair": 7429.868,
"tool_route": 31.695
} | {
"cheap_model": 0.00001322,
"code_specialist": 0.0001338,
"code_specialist_repair": 0.0001329,
"medium_model": 0.00004882,
"strong_model": 0.00167475,
"strong_repair": 0.00121475,
"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/111 | humaneval::HumanEval/111 |
real::humaneval::humaneval-114 | def minSubArraySum(nums):
"""
Given an array of integers nums, find the minimum sum of any non-empty sub-array
of nums.
Example
minSubArraySum([2, 3, 4, 1, 2, 4]) == 1
minSubArraySum([-1, -2, -3]) == -6
"""
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": 2542.386,
"code_specialist": 5774.459,
"code_specialist_repair": 4040.125,
"medium_model": 2000.62,
"strong_model": 5620.116,
"strong_repair": 5274.388,
"tool_route": 27.493
} | {
"cheap_model": 0.00001183,
"code_specialist": 0.0001122,
"code_specialist_repair": 0.0000933,
"medium_model": 0.00003464,
"strong_model": 0.00112525,
"strong_repair": 0.00089925,
"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/114 | humaneval::HumanEval/114 |
real::humaneval::humaneval-115 | def max_fill(grid, capacity):
import math
"""
You are given a rectangular grid of wells. Each row represents a single well,
and each 1 in a row represents a single unit of water.
Each well has a corresponding bucket that can be used to extract water from it,
and all buckets have the same capacit... | 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": 1957.903,
"code_specialist": 2085.204,
"code_specialist_repair": 2773.366,
"medium_model": 3468.599,
"strong_model": 7438.459,
"strong_repair": 8673.326,
"tool_route": 31.391
} | {
"cheap_model": 0.00002215,
"code_specialist": 0.0001689,
"code_specialist_repair": 0.0001515,
"medium_model": 0.00004836,
"strong_model": 0.001405,
"strong_repair": 0.001547,
"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/115 | humaneval::HumanEval/115 |
real::humaneval::humaneval-116 | def sort_array(arr):
"""
In this Kata, you have to sort an array of non-negative integers according to
number of ones in their binary representation in ascending order.
For similar number of ones, sort based on decimal value.
It must be implemented like this:
>>> sort_array([1, 5, 2, 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": 984.674,
"code_specialist": 2463.652,
"code_specialist_repair": 1947.397,
"medium_model": 1196.424,
"strong_model": 13455.447,
"strong_repair": 16056.183,
"tool_route": 29.694
} | {
"cheap_model": 0.00001566,
"code_specialist": 0.0001161,
"code_specialist_repair": 0.000117,
"medium_model": 0.00003132,
"strong_model": 0.00263975,
"strong_repair": 0.00305575,
"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/116 | humaneval::HumanEval/116 |
real::humaneval::humaneval-118 | def get_closest_vowel(word):
"""You are given a word. Your task is to find the closest vowel that stands between
two consonants from the right side of the word (case sensitive).
Vowels in the beginning and ending doesn't count. Return empty string if you didn't
find any vowel met the above condition.
... | 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": 1382.552,
"code_specialist": 3390.492,
"code_specialist_repair": 3623.024,
"medium_model": 1329.889,
"strong_model": 9313.725,
"strong_repair": 10415.297,
"tool_route": 30.522
} | {
"cheap_model": 0.00001787,
"code_specialist": 0.0001299,
"code_specialist_repair": 0.0001299,
"medium_model": 0.00004598,
"strong_model": 0.00174925,
"strong_repair": 0.00169925,
"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/118 | humaneval::HumanEval/118 |
real::humaneval::humaneval-119 | def match_parens(lst):
'''
You are given a list of two strings, both strings consist of open
parentheses '(' or close parentheses ')' only.
Your job is to check if it is possible to concatenate the two strings in
some order, that the resulting string will be good.
A string S is considered to be ... | 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": 4130.445,
"code_specialist": 13257.13,
"code_specialist_repair": 6343.661,
"medium_model": 6894.823,
"strong_model": 7422.114,
"strong_repair": 4912.455,
"tool_route": 25.37
} | {
"cheap_model": 0.00001783,
"code_specialist": 0.0001665,
"code_specialist_repair": 0.0001665,
"medium_model": 0.00005534,
"strong_model": 0.0011885,
"strong_repair": 0.0007605,
"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/119 | humaneval::HumanEval/119 |
real::humaneval::humaneval-123 | def get_odd_collatz(n):
"""
Given a positive integer n, return a sorted list that has the odd numbers in collatz sequence.
The Collatz conjecture is a conjecture in mathematics that concerns a sequence defined
as follows: start with any positive integer n. Then each term is obtained from the
previo... | 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": 4087.192,
"code_specialist": 11561.229,
"code_specialist_repair": 10039.191,
"medium_model": 5571.079,
"strong_model": 6651.315,
"strong_repair": 6395.392,
"tool_route": 26.987
} | {
"cheap_model": 0.00002133,
"code_specialist": 0.0001656,
"code_specialist_repair": 0.000153,
"medium_model": 0.000053,
"strong_model": 0.00104725,
"strong_repair": 0.00121525,
"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/123 | humaneval::HumanEval/123 |
real::humaneval::humaneval-125 | def split_words(txt):
'''
Given a string of words, return a list of words split on whitespace, if no whitespaces exists in the text you
should split on commas ',' if no commas exists you should return the number of lower-case letters with odd order in the
alphabet, ord('a') = 0, ord('b') = 1, ... ord('z... | 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": 932.247,
"code_specialist": 3488.93,
"code_specialist_repair": 3487.946,
"medium_model": 2488.787,
"strong_model": 8105.875,
"strong_repair": 7935.289,
"tool_route": 34.673
} | {
"cheap_model": 0.00001464,
"code_specialist": 0.0001332,
"code_specialist_repair": 0.0001323,
"medium_model": 0.00003846,
"strong_model": 0.00142225,
"strong_repair": 0.00156225,
"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/125 | humaneval::HumanEval/125 |
real::humaneval::humaneval-128 | def prod_signs(arr):
"""
You are given an array arr of integers and you need to return
sum of magnitudes of integers multiplied by product of all signs
of each number in the array, represented by 1, -1 or 0.
Note: return None for empty arr.
Example:
>>> prod_signs([1, 2, 2, -4]) == -9
>... | 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": 8726.968,
"code_specialist": 6185.062,
"code_specialist_repair": 5459.639,
"medium_model": 1261.083,
"strong_model": 8529.012,
"strong_repair": 6170.855,
"tool_route": 32.368
} | {
"cheap_model": 0.00001385,
"code_specialist": 0.0001467,
"code_specialist_repair": 0.0001287,
"medium_model": 0.00004146,
"strong_model": 0.00146175,
"strong_repair": 0.00120175,
"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/128 | humaneval::HumanEval/128 |
real::humaneval::humaneval-130 | def tri(n):
"""Everyone knows Fibonacci sequence, it was studied deeply by mathematicians in
the last couple centuries. However, what people don't know is Tribonacci sequence.
Tribonacci sequence is defined by the recurrence:
tri(1) = 3
tri(n) = 1 + n / 2, if n is even.
tri(n) = tri(n - 1) + tr... | 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": 2002.35,
"code_specialist": 15271.194,
"code_specialist_repair": 1977.874,
"medium_model": 13800.556,
"strong_model": 15253.68,
"strong_repair": 22233.058,
"tool_route": 34.47
} | {
"cheap_model": 0.00002219,
"code_specialist": 0.0002058,
"code_specialist_repair": 0.0001773,
"medium_model": 0.00006012,
"strong_model": 0.00249975,
"strong_repair": 0.00372375,
"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/130 | humaneval::HumanEval/130 |
real::humaneval::humaneval-131 | def digits(n):
"""Given a positive integer n, return the product of the odd digits.
Return 0 if all digits are even.
For example:
digits(1) == 1
digits(4) == 0
digits(235) == 15
"""
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": 876.59,
"code_specialist": 4617.509,
"code_specialist_repair": 7719.863,
"medium_model": 1265.608,
"strong_model": 9776.885,
"strong_repair": 5661.672,
"tool_route": 31.705
} | {
"cheap_model": 0.00001007,
"code_specialist": 0.0000912,
"code_specialist_repair": 0.0000912,
"medium_model": 0.00003902,
"strong_model": 0.001613,
"strong_repair": 0.001095,
"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/131 | humaneval::HumanEval/131 |
real::humaneval::humaneval-132 | def is_nested(string):
'''
Create a function that takes a string as input which contains only square brackets.
The function should return True if and only if there is a valid subsequence of brackets
where at least one bracket in the subsequence is nested.
is_nested('[[]]') ➞ True
is_nested('[]]... | 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": 1025.296,
"code_specialist": 6423.394,
"code_specialist_repair": 8407.624,
"medium_model": 2017.312,
"strong_model": 19936.335,
"strong_repair": 17140.432,
"tool_route": 29.936
} | {
"cheap_model": 0.00001173,
"code_specialist": 0.0000972,
"code_specialist_repair": 0.0001179,
"medium_model": 0.00003946,
"strong_model": 0.0040465,
"strong_repair": 0.0040885,
"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/132 | humaneval::HumanEval/132 |
real::humaneval::humaneval-133 | def sum_squares(lst):
"""You are given a list of numbers.
You need to return the sum of squared numbers in the given list,
round each element in the list to the upper int(Ceiling) first.
Examples:
For lst = [1,2,3] the output should be 14
For lst = [1,4,9] the output should be 98
For lst = [... | 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": 1247.349,
"code_specialist": 874.156,
"code_specialist_repair": 5327.648,
"medium_model": 7108.705,
"strong_model": 10029.479,
"strong_repair": 5865.267,
"tool_route": 32.478
} | {
"cheap_model": 0.00001221,
"code_specialist": 0.0000822,
"code_specialist_repair": 0.0001323,
"medium_model": 0.00002896,
"strong_model": 0.0014865,
"strong_repair": 0.0008085,
"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/133 | humaneval::HumanEval/133 |
real::humaneval::humaneval-135 | def can_arrange(arr):
"""Create a function which returns the largest index of an element which
is not greater than or equal to the element immediately preceding it. If
no such element exists then return -1. The given array will not contain
duplicate values.
Examples:
can_arrange([1,2,4,3,5]) = ... | 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": 2465.55,
"code_specialist": 6134.528,
"code_specialist_repair": 5388.377,
"medium_model": 1552.818,
"strong_model": 4597.537,
"strong_repair": 4551.771,
"tool_route": 30.417
} | {
"cheap_model": 0.0000105,
"code_specialist": 0.0000855,
"code_specialist_repair": 0.0000828,
"medium_model": 0.0000307,
"strong_model": 0.000789,
"strong_repair": 0.000877,
"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/135 | humaneval::HumanEval/135 |
real::humaneval::humaneval-136 | def largest_smallest_integers(lst):
'''
Create a function that returns a tuple (a, b), where 'a' is
the largest of negative integers, and 'b' is the smallest
of positive integers in a list.
If there is no negative or positive integers, return them as None.
Examples:
largest_smallest_integer... | 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": 3601.998,
"code_specialist": 2856.557,
"code_specialist_repair": 5082.386,
"medium_model": 3558.699,
"strong_model": 8734.256,
"strong_repair": 7224.372,
"tool_route": 29.738
} | {
"cheap_model": 0.00001593,
"code_specialist": 0.0001404,
"code_specialist_repair": 0.0001338,
"medium_model": 0.00003858,
"strong_model": 0.00122875,
"strong_repair": 0.00167875,
"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/136 | humaneval::HumanEval/136 |
real::humaneval::humaneval-137 | def compare_one(a, b):
"""
Create a function that takes integers, floats, or strings representing
real numbers, and returns the larger variable in its given variable type.
Return None if the values are equal.
Note: If a real number is represented as a string, the floating point might be . or ,
... | 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": 2910.034,
"code_specialist": 11400.147,
"code_specialist_repair": 14027.692,
"medium_model": 3959.749,
"strong_model": 11103.214,
"strong_repair": 10028.989,
"tool_route": 36.553
} | {
"cheap_model": 0.00001352,
"code_specialist": 0.0001419,
"code_specialist_repair": 0.0001428,
"medium_model": 0.00005136,
"strong_model": 0.0019265,
"strong_repair": 0.0021705,
"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/137 | humaneval::HumanEval/137 |
real::humaneval::humaneval-139 | def special_factorial(n):
"""The Brazilian factorial is defined as:
brazilian_factorial(n) = n! * (n-1)! * (n-2)! * ... * 1!
where n > 0
For example:
>>> special_factorial(4)
288
The function will receive an integer as input and should return the special
factorial of this integer.
... | coding | humaneval | humaneval | function_call | [] | prompt_only | false | true | 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": 0,
"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": 180.943,
"code_specialist": 2462.769,
"code_specialist_repair": 2469.706,
"medium_model": 1093.345,
"strong_model": 8783.454,
"strong_repair": 5639.27,
"tool_route": 28.049
} | {
"cheap_model": 0.00001086,
"code_specialist": 0.0001068,
"code_specialist_repair": 0.0001086,
"medium_model": 0.00003596,
"strong_model": 0.001421,
"strong_repair": 0.001291,
"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/139 | humaneval::HumanEval/139 |
real::humaneval::humaneval-140 | def fix_spaces(text):
"""
Given a string text, replace all spaces in it with underscores,
and if a string has more than 2 consecutive spaces,
then replace all consecutive spaces with -
fix_spaces("Example") == "Example"
fix_spaces("Example 1") == "Example_1"
fix_spaces(" Example 2") == "_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": 946.014,
"code_specialist": 3380.156,
"code_specialist_repair": 5889.777,
"medium_model": 6266.396,
"strong_model": 10726.737,
"strong_repair": 11327.904,
"tool_route": 25.821
} | {
"cheap_model": 0.00001135,
"code_specialist": 0.000084,
"code_specialist_repair": 0.000084,
"medium_model": 0.00003092,
"strong_model": 0.001797,
"strong_repair": 0.002591,
"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/140 | humaneval::HumanEval/140 |
real::humaneval::humaneval-142 | def sum_squares(lst):
""""
This function will take a list of integers. For all entries in the list, the function shall square the integer entry if its index is a
multiple of 3 and will cube the integer entry if its index is a multiple of 4 and not a multiple of 3. The function will not
change the entrie... | 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": 2892.956,
"code_specialist": 2851.81,
"code_specialist_repair": 4082.554,
"medium_model": 1744.582,
"strong_model": 12779.13,
"strong_repair": 11974.048,
"tool_route": 28.731
} | {
"cheap_model": 0.00001439,
"code_specialist": 0.0001269,
"code_specialist_repair": 0.0001257,
"medium_model": 0.0000407,
"strong_model": 0.00254925,
"strong_repair": 0.00289325,
"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/142 | humaneval::HumanEval/142 |
real::humaneval::humaneval-143 | def words_in_sentence(sentence):
"""
You are given a string representing a sentence,
the sentence contains some words separated by a space,
and you have to return a string that contains the words from the original sentence,
whose lengths are prime numbers,
the order of the words in the new strin... | 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": 2834.819,
"code_specialist": 11451.143,
"code_specialist_repair": 5456.759,
"medium_model": 1795.334,
"strong_model": 5212.771,
"strong_repair": 4542.384,
"tool_route": 34.125
} | {
"cheap_model": 0.00001611,
"code_specialist": 0.0001464,
"code_specialist_repair": 0.0001419,
"medium_model": 0.00006038,
"strong_model": 0.001146,
"strong_repair": 0.001252,
"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/143 | humaneval::HumanEval/143 |
real::humaneval::humaneval-150 | def x_or_y(n, x, y):
"""A simple program which should return the value of x if n is
a prime number and should return the value of y otherwise.
Examples:
for x_or_y(7, 34, 12) == 34
for x_or_y(15, 8, 5) == 5
"""
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": 500.684,
"code_specialist": 2294.393,
"code_specialist_repair": 1292.141,
"medium_model": 3982.073,
"strong_model": 9138.588,
"strong_repair": 7286.518,
"tool_route": 36.603
} | {
"cheap_model": 0.00001433,
"code_specialist": 0.0000915,
"code_specialist_repair": 0.0000915,
"medium_model": 0.0000401,
"strong_model": 0.00121675,
"strong_repair": 0.00163475,
"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/150 | humaneval::HumanEval/150 |
real::humaneval::humaneval-151 | def double_the_difference(lst):
'''
Given a list of numbers, return the sum of squares of the numbers
in the list that are odd. Ignore numbers that are negative or not integers.
double_the_difference([1, 3, 2, 0]) == 1 + 9 + 0 + 0 = 10
double_the_difference([-1, -2, 0]) == 0
double_the_differen... | 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": 1201.457,
"code_specialist": 2741.078,
"code_specialist_repair": 1771.189,
"medium_model": 1696.262,
"strong_model": 4462.128,
"strong_repair": 6018.298,
"tool_route": 26.924
} | {
"cheap_model": 0.00001183,
"code_specialist": 0.0001038,
"code_specialist_repair": 0.0000924,
"medium_model": 0.00003324,
"strong_model": 0.001157,
"strong_repair": 0.001673,
"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/151 | humaneval::HumanEval/151 |
real::humaneval::humaneval-153 | def Strongest_Extension(class_name, extensions):
"""You will be given the name of a class (a string) and a list of extensions.
The extensions are to be used to load additional classes to the class. The
strength of the extension is as follows: Let CAP be the number of the uppercase
letters in the extensi... | 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": 3893.788,
"code_specialist": 2170.683,
"code_specialist_repair": 2195.494,
"medium_model": 3458.649,
"strong_model": 9126.244,
"strong_repair": 7369.417,
"tool_route": 27.2
} | {
"cheap_model": 0.00002075,
"code_specialist": 0.0002073,
"code_specialist_repair": 0.0002064,
"medium_model": 0.00005494,
"strong_model": 0.001471,
"strong_repair": 0.002087,
"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/153 | humaneval::HumanEval/153 |
real::humaneval::humaneval-156 | def int_to_mini_roman(number):
"""
Given a positive integer, obtain its roman numeral equivalent as a string,
and return it in lowercase.
Restrictions: 1 <= num <= 1000
Examples:
>>> int_to_mini_roman(19) == 'xix'
>>> int_to_mini_roman(152) == 'clii'
>>> int_to_mini_roman(426) == 'cdxxv... | 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": 6303.492,
"code_specialist": 3678.653,
"code_specialist_repair": 9360.062,
"medium_model": 6528.217,
"strong_model": 8234.524,
"strong_repair": 6494.995,
"tool_route": 30.704
} | {
"cheap_model": 0.00001784,
"code_specialist": 0.0001881,
"code_specialist_repair": 0.0002013,
"medium_model": 0.00005856,
"strong_model": 0.0015835,
"strong_repair": 0.0015075,
"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/156 | humaneval::HumanEval/156 |
real::humaneval::humaneval-158 | def find_max(words):
"""Write a function that accepts a list of strings.
The list contains different words. Return the word with maximum number
of unique characters. If multiple strings have maximum number of unique
characters, return the one which comes first in lexicographical order.
find_max(["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": 835.998,
"code_specialist": 2929.373,
"code_specialist_repair": 10149.596,
"medium_model": 2120.581,
"strong_model": 5830.519,
"strong_repair": 4857.349,
"tool_route": 31.161
} | {
"cheap_model": 0.00001084,
"code_specialist": 0.0000783,
"code_specialist_repair": 0.0001251,
"medium_model": 0.00003816,
"strong_model": 0.00097325,
"strong_repair": 0.00130525,
"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/158 | humaneval::HumanEval/158 |
real::humaneval::humaneval-160 | def do_algebra(operator, operand):
"""
Given two lists operator, and operand. The first list has basic algebra operations, and
the second list is a list of integers. Use the two given lists to build the algebric
expression and return the evaluation of this expression.
The basic algebra operations:
... | 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": 656.296,
"code_specialist": 4100.479,
"code_specialist_repair": 2174.914,
"medium_model": 19868.425,
"strong_model": 9228.59,
"strong_repair": 11111.016,
"tool_route": 25.138
} | {
"cheap_model": 0.00003853,
"code_specialist": 0.0001809,
"code_specialist_repair": 0.0001848,
"medium_model": 0.00004114,
"strong_model": 0.001562,
"strong_repair": 0.002694,
"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/160 | humaneval::HumanEval/160 |
real::humaneval::humaneval-161 | def solve(s):
"""You are given a string s.
if s[i] is a letter, reverse its case from lower to upper or vise versa,
otherwise keep it as it is.
If the string contains no letters, reverse the string.
The function should return the resulted string.
Examples
solve("1234") = "4321"
solve("ab... | 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": 1441.721,
"code_specialist": 5672.527,
"code_specialist_repair": 5311.257,
"medium_model": 1224.768,
"strong_model": 4188.811,
"strong_repair": 4070.076,
"tool_route": 30.768
} | {
"cheap_model": 0.00001942,
"code_specialist": 0.0001161,
"code_specialist_repair": 0.0001224,
"medium_model": 0.00003482,
"strong_model": 0.00117775,
"strong_repair": 0.00103975,
"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/161 | humaneval::HumanEval/161 |
real::mbpp::1 | Write a function to find the minimum cost path to reach (m, n) from (0, 0) for the given cost matrix cost[][] and a position (m, n) in cost[][].
Your function must be named `min_cost`.
Return only the function in a single python code block. No explanation. | coding | mbpp | mbpp | function_call | [] | prompt_only | true | true | false | true | strong_model | strong_model | strong_model | 0.666667 | true | false | true | false | strong_model | false | false | ["strong_model", "strong_repair"] | null | pol-644b522cec4e | {
"cheap_model": 0.333333,
"code_specialist": 0,
"code_specialist_repair": 0,
"medium_model": 0,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": -0.666667,
"code_specialist": -1,
"code_specialist_repair": -1,
"medium_model": -1,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 6264.468,
"code_specialist": 3903.113,
"code_specialist_repair": 9419.294,
"medium_model": 4241.146,
"strong_model": 7086.683,
"strong_repair": 8906.704,
"tool_route": 31.697
} | {
"cheap_model": 0.0000154,
"code_specialist": 0.0001992,
"code_specialist_repair": 0.0004992,
"medium_model": 0.00006514,
"strong_model": 0.0016255,
"strong_repair": 0.0018775,
"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 | mbpp::coding::mbpp::mbpp::1 | mbpp::1 |
real::mbpp::3 | Write a python function to identify non-prime numbers.
Your function must be named `is_not_prime`.
Return only the function in a single python code block. No explanation. | coding | mbpp | mbpp | 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": 950.599,
"code_specialist": 7253.984,
"code_specialist_repair": 7536.361,
"medium_model": 5403.577,
"strong_model": 6315.939,
"strong_repair": 15300.606,
"tool_route": 26.321
} | {
"cheap_model": 0.00000819,
"code_specialist": 0.0000699,
"code_specialist_repair": 0.0000708,
"medium_model": 0.00002556,
"strong_model": 0.001136,
"strong_repair": 0.003068,
"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 | mbpp::coding::mbpp::mbpp::3 | mbpp::3 |
real::mbpp::5 | Write a function to find the number of ways to fill it with 2 x 1 dominoes for the given 3 x n board.
Your function must be named `count_ways`.
Return only the function in a single python code block. No explanation. | coding | mbpp | mbpp | function_call | [] | prompt_only | true | true | false | true | code_specialist_repair | code_specialist_repair | code_specialist_repair | 1 | true | false | true | false | code_specialist_repair | false | false | ["code_specialist", "code_specialist_repair", "strong_model", "strong_repair"] | null | pol-644b522cec4e | {
"cheap_model": 0,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": 0.333333,
"strong_model": 1,
"strong_repair": 1,
"tool_route": 0
} | {
"cheap_model": -1,
"code_specialist": 1,
"code_specialist_repair": 1,
"medium_model": -0.666667,
"strong_model": 1,
"strong_repair": 1,
"tool_route": -1
} | {
"cheap_model": 881.4,
"code_specialist": 13023.992,
"code_specialist_repair": 12966.293,
"medium_model": 5103.459,
"strong_model": 11114.367,
"strong_repair": 13702.948,
"tool_route": 33.491
} | {
"cheap_model": 0.00000674,
"code_specialist": 0.0001266,
"code_specialist_repair": 0.0001122,
"medium_model": 0.00004346,
"strong_model": 0.0016245,
"strong_repair": 0.0021945,
"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 | mbpp::coding::mbpp::mbpp::5 | mbpp::5 |
real::mbpp::6 | Write a python function to check whether the two numbers differ at one bit position only or not.
Your function must be named `is_Power_Of_Two`.
Return only the function in a single python code block. No explanation. | coding | mbpp | mbpp | function_call | [] | prompt_only | true | true | true | false | tool_route | tool_route | tool_route | 1 | false | false | false | false | null | true | false | [] | null | pol-644b522cec4e | {
"cheap_model": 0,
"code_specialist": 0,
"code_specialist_repair": 0,
"medium_model": 0,
"strong_model": 0,
"strong_repair": 0,
"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": 438.225,
"code_specialist": 3783.284,
"code_specialist_repair": 5249.228999999999,
"medium_model": 3363.914,
"strong_model": 7892.825,
"strong_repair": 21071.893,
"tool_route": 29.765
} | {
"cheap_model": 0.000013,
"code_specialist": 0.0000681,
"code_specialist_repair": 0.0001884,
"medium_model": 0.00001888,
"strong_model": 0.001425,
"strong_repair": 0.0029632499999999997,
"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 | mbpp::coding::mbpp::mbpp::6 | mbpp::6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.