{"date": "2026-11-03 05:45", "hash": "fe585eb4df8c88d844eeb463ea4d0302", "eval": {"HumanEval/0": [{"task_id": "HumanEval/0", "solution": "from typing import List\ndef has_close_elements(numbers: List[float], threshold: float) -> bool:\n \"\"\" Check if in given list of numbers, are any two numbers closer to each other than\n given threshold.\n >>> has_close_elements([1.0, 2.0, 3.0], 0.5)\n False\n >>> has_close_elements([1.0, 2.8, 3.0, 4.0, 5.0, 2.0], 0.3)\n True\n \"\"\"\n if len(numbers) < 2:\n return False\n \n sorted_numbers = sorted(numbers)\n \n for i in range(len(sorted_numbers) - 1):\n if abs(sorted_numbers[i] - sorted_numbers[i + 1]) < threshold:\n return True\n \n return False", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/1": [{"task_id": "HumanEval/1", "solution": "from typing import List\ndef separate_paren_groups(paren_string: str) -> List[str]:\n \"\"\" Input to this function is a string containing multiple groups of nested parentheses. Your goal is to\n separate those group into separate strings and return the list of those.\n Separate groups are balanced (each open brace is properly closed) and not nested within each other\n Ignore any spaces in the input string.\n >>> separate_paren_groups('( ) (( )) (( )( ))')\n ['()', '(())', '(()())']\n \"\"\"\n # Remove all spaces from the input string\n cleaned = paren_string.replace(' ', '')\n \n result = []\n current_group = []\n depth = 0\n \n for char in cleaned:\n if char == '(':\n depth += 1\n current_group.append(char)\n elif char == ')':\n depth -= 1\n current_group.append(char)\n if depth == 0:\n # We've completed a balanced group\n result.append(''.join(current_group))\n current_group = []\n \n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/2": [{"task_id": "HumanEval/2", "solution": "def truncate_number(number: float) -> float:\n \"\"\" Given a positive floating point number, it can be decomposed into\n and integer part (largest integer smaller than given number) and decimals\n (leftover part always smaller than 1).\n\n Return the decimal part of the number.\n >>> truncate_number(3.5)\n 0.5\n \"\"\"\n import math\n integer_part = math.floor(number)\n decimal_part = number - integer_part\n return decimal_part", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/6": [{"task_id": "HumanEval/6", "solution": "from typing import List\ndef parse_nested_parens(paren_string: str) -> List[int]:\n \"\"\" Input to this function is a string represented multiple groups for nested parentheses separated by spaces.\n For each of the group, output the deepest level of nesting of parentheses.\n E.g. (()()) has maximum two levels of nesting while ((())) has three.\n\n >>> parse_nested_parens('(()()) ((())) () ((())()())')\n [2, 3, 1, 3]\n \"\"\"\n if not paren_string:\n return []\n \n groups = paren_string.split()\n result = []\n \n for group in groups:\n max_depth = 0\n current_depth = 0\n for char in group:\n if char == '(':\n current_depth += 1\n if current_depth > max_depth:\n max_depth = current_depth\n elif char == ')':\n current_depth -= 1\n result.append(max_depth)\n \n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/5": [{"task_id": "HumanEval/5", "solution": "from typing import List\ndef intersperse(numbers: List[int], delimeter: int) -> List[int]:\n \"\"\" Insert a number 'delimeter' between every two consecutive elements of input list `numbers'\n >>> intersperse([], 4)\n []\n >>> intersperse([1, 2, 3], 4)\n [1, 4, 2, 4, 3]\n \"\"\"\n if not numbers:\n return []\n \n result = []\n for i, num in enumerate(numbers):\n result.append(num)\n if i < len(numbers) - 1:\n result.append(delimeter)\n \n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/3": [{"task_id": "HumanEval/3", "solution": "from typing import List\ndef below_zero(operations: List[int]) -> bool:\n \"\"\" You're given a list of deposit and withdrawal operations on a bank account that starts with\n zero balance. Your task is to detect if at any point the balance of account fallls below zero, and\n at that point function should return True. Otherwise it should return False.\n >>> below_zero([1, 2, 3])\n False\n >>> below_zero([1, 2, -4, 5])\n True\n \"\"\"\n balance = 0\n for op in operations:\n balance += op\n if balance < 0:\n return True\n return False", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/4": [{"task_id": "HumanEval/4", "solution": "from typing import List\ndef mean_absolute_deviation(numbers: List[float]) -> float:\n \"\"\" For a given list of input numbers, calculate Mean Absolute Deviation\n around the mean of this dataset.\n Mean Absolute Deviation is the average absolute difference between each\n element and a centerpoint (mean in this case):\n MAD = average | x - x_mean |\n >>> mean_absolute_deviation([1.0, 2.0, 3.0, 4.0])\n 1.0\n \"\"\"\n if not numbers:\n return 0.0\n \n n = len(numbers)\n x_mean = sum(numbers) / n\n \n mad = sum(abs(x - x_mean) for x in numbers) / n\n \n return mad", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/7": [{"task_id": "HumanEval/7", "solution": "from typing import List\ndef filter_by_substring(strings: List[str], substring: str) -> List[str]:\n \"\"\" Filter an input list of strings only for ones that contain given substring\n >>> filter_by_substring([], 'a')\n []\n >>> filter_by_substring(['abc', 'bacd', 'cde', 'array'], 'a')\n ['abc', 'bacd', 'array']\n \"\"\"\n return [s for s in strings if substring in s]", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/9": [{"task_id": "HumanEval/9", "solution": "from typing import List, Tuple\ndef rolling_max(numbers: List[int]) -> List[int]:\n \"\"\" From a given list of integers, generate a list of rolling maximum element found until given moment\n in the sequence.\n >>> rolling_max([1, 2, 3, 2, 3, 4, 2])\n [1, 2, 3, 3, 3, 4, 4]\n \"\"\"\n if not numbers:\n return []\n \n result = []\n current_max = numbers[0]\n for num in numbers:\n if num > current_max:\n current_max = num\n result.append(current_max)\n \n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/8": [{"task_id": "HumanEval/8", "solution": "from typing import List, Tuple\ndef sum_product(numbers: List[int]) -> Tuple[int, int]:\n \"\"\" For a given list of integers, return a tuple consisting of a sum and a product of all the integers in a list.\n Empty sum should be equal to 0 and empty product should be equal to 1.\n >>> sum_product([])\n (0, 1)\n >>> sum_product([1, 2, 3, 4])\n (10, 24)\n \"\"\"\n if not numbers:\n return (0, 1)\n \n total_sum = sum(numbers)\n total_product = 1\n for num in numbers:\n total_product *= num\n \n return (total_sum, total_product)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/10": [{"task_id": "HumanEval/10", "solution": "def is_palindrome(string: str) -> bool:\n \"\"\" Test if given string is a palindrome \"\"\"\n return string == string[::-1]\ndef make_palindrome(string: str) -> str:\n \"\"\" Find the shortest palindrome that begins with a supplied string.\n Algorithm idea is simple:\n - Find the longest postfix of supplied string that is a palindrome.\n - Append to the end of the string reverse of a string prefix that comes before the palindromic suffix.\n >>> make_palindrome('')\n ''\n >>> make_palindrome('cat')\n 'catac'\n >>> make_palindrome('cata')\n 'catac'\n \"\"\"\n if not string:\n return ''\n \n # Find the longest suffix of the string that is a palindrome\n # We need to find the longest palindromic suffix\n n = len(string)\n \n # Check from the full string down to single character\n # The longest palindromic suffix starting at index i means string[i:] is a palindrome\n for i in range(n):\n suffix = string[i:]\n if is_palindrome(suffix):\n # The prefix before this suffix is string[:i]\n # We need to append the reverse of this prefix to the end\n prefix = string[:i]\n return string + prefix[::-1]\n \n # This should never be reached since a single character is always a palindrome\n return string", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/11": [{"task_id": "HumanEval/11", "solution": "from typing import List\ndef string_xor(a: str, b: str) -> str:\n \"\"\" Input are two strings a and b consisting only of 1s and 0s.\n Perform binary XOR on these inputs and return result also as a string.\n >>> string_xor('010', '110')\n '100'\n \"\"\"\n result = []\n for char_a, char_b in zip(a, b):\n # XOR: different bits give '1', same bits give '0'\n if char_a != char_b:\n result.append('1')\n else:\n result.append('0')\n return ''.join(result)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/13": [{"task_id": "HumanEval/13", "solution": "def greatest_common_divisor(a: int, b: int) -> int:\n \"\"\" Return a greatest common divisor of two integers a and b\n >>> greatest_common_divisor(3, 5)\n 1\n >>> greatest_common_divisor(25, 15)\n 5\n \"\"\"\n # Use the Euclidean algorithm to compute GCD\n a, b = abs(a), abs(b)\n while b:\n a, b = b, a % b\n return a", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/12": [{"task_id": "HumanEval/12", "solution": "from typing import List, Optional\ndef longest(strings: List[str]) -> Optional[str]:\n \"\"\" Out of list of strings, return the longest one. Return the first one in case of multiple\n strings of the same length. Return None in case the input list is empty.\n >>> longest([])\n\n >>> longest(['a', 'b', 'c'])\n 'a'\n >>> longest(['a', 'bb', 'ccc'])\n 'ccc'\n \"\"\"\n if not strings:\n return None\n \n longest_str = strings[0]\n for s in strings[1:]:\n if len(s) > len(longest_str):\n longest_str = s\n \n return longest_str", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/14": [{"task_id": "HumanEval/14", "solution": "from typing import List\ndef all_prefixes(string: str) -> List[str]:\n \"\"\" Return list of all prefixes from shortest to longest of the input string\n >>> all_prefixes('abc')\n ['a', 'ab', 'abc']\n \"\"\"\n prefixes = []\n for i in range(1, len(string) + 1):\n prefixes.append(string[:i])\n return prefixes", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/17": [{"task_id": "HumanEval/17", "solution": "from typing import List\ndef parse_music(music_string: str) -> List[int]:\n \"\"\" Input to this function is a string representing musical notes in a special ASCII format.\n Your task is to parse this string and return list of integers corresponding to how many beats does each\n not last.\n\n Here is a legend:\n 'o' - whole note, lasts four beats\n 'o|' - half note, lasts two beats\n '.|' - quater note, lasts one beat\n\n >>> parse_music('o o| .| o| o| .| .| .| .| o o')\n [4, 2, 1, 2, 2, 1, 1, 1, 1, 4, 4]\n \"\"\"\n if not music_string:\n return []\n \n notes = music_string.split()\n result = []\n for note in notes:\n if note == 'o':\n result.append(4)\n elif note == 'o|':\n result.append(2)\n elif note == '.|':\n result.append(1)\n else:\n raise ValueError(f\"Unknown note: {note}\")\n \n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/18": [{"task_id": "HumanEval/18", "solution": "def how_many_times(string: str, substring: str) -> int:\n \"\"\" Find how many times a given substring can be found in the original string. Count overlaping cases.\n >>> how_many_times('', 'a')\n 0\n >>> how_many_times('aaa', 'a')\n 3\n >>> how_many_times('aaaa', 'aa')\n 3\n \"\"\"\n if not substring:\n return 0\n \n count = 0\n start = 0\n while True:\n index = string.find(substring, start)\n if index == -1:\n break\n count += 1\n start = index + 1\n \n return count", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/16": [{"task_id": "HumanEval/16", "solution": "def count_distinct_characters(string: str) -> int:\n \"\"\" Given a string, find out how many distinct characters (regardless of case) does it consist of\n >>> count_distinct_characters('xyzXYZ')\n 3\n >>> count_distinct_characters('Jerry')\n 4\n \"\"\"\n # Convert the string to lowercase to make it case-insensitive\n lower_string = string.lower()\n # Use a set to get distinct characters\n distinct_chars = set(lower_string)\n return len(distinct_chars)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/19": [{"task_id": "HumanEval/19", "solution": "from typing import List\ndef sort_numbers(numbers: str) -> str:\n \"\"\" Input is a space-delimited string of numberals from 'zero' to 'nine'.\n Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.\n Return the string with numbers sorted from smallest to largest\n >>> sort_numbers('three one five')\n 'one three five'\n \"\"\"\n if not numbers or not numbers.strip():\n return \"\"\n \n # Map word to numeric value\n word_to_num = {\n 'zero': 0,\n 'one': 1,\n 'two': 2,\n 'three': 3,\n 'four': 4,\n 'five': 5,\n 'six': 6,\n 'seven': 7,\n 'eight': 8,\n 'nine': 9\n }\n \n # Split the input string into individual words\n words = numbers.strip().split()\n \n # Sort the words based on their numeric value\n sorted_words = sorted(words, key=lambda w: word_to_num[w.lower()])\n \n # Join the sorted words back into a space-delimited string\n return ' '.join(sorted_words)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/20": [{"task_id": "HumanEval/20", "solution": "from typing import List, Tuple\ndef find_closest_elements(numbers: List[float]) -> Tuple[float, float]:\n \"\"\" From a supplied list of numbers (of length at least two) select and return two that are the closest to each\n other and return them in order (smaller number, larger number).\n >>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.2])\n (2.0, 2.2)\n >>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.0])\n (2.0, 2.0)\n \"\"\"\n # Sort the numbers to make it easy to find closest pairs\n sorted_nums = sorted(numbers)\n \n # Initialize with the first pair\n min_diff = float('inf')\n closest_pair = (sorted_nums[0], sorted_nums[1])\n \n # Iterate through adjacent pairs in the sorted list\n for i in range(len(sorted_nums) - 1):\n diff = sorted_nums[i + 1] - sorted_nums[i]\n if diff < min_diff:\n min_diff = diff\n closest_pair = (sorted_nums[i], sorted_nums[i + 1])\n \n return closest_pair", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/21": [{"task_id": "HumanEval/21", "solution": "from typing import List\ndef rescale_to_unit(numbers: List[float]) -> List[float]:\n \"\"\" Given list of numbers (of at least two elements), apply a linear transform to that list,\n such that the smallest number will become 0 and the largest will become 1\n >>> rescale_to_unit([1.0, 2.0, 3.0, 4.0, 5.0])\n [0.0, 0.25, 0.5, 0.75, 1.0]\n \"\"\"\n min_val = min(numbers)\n max_val = max(numbers)\n \n if min_val == max_val:\n # All elements are the same, return list of zeros\n return [0.0] * len(numbers)\n \n range_val = max_val - min_val\n return [(x - min_val) / range_val for x in numbers]", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/22": [{"task_id": "HumanEval/22", "solution": "from typing import List, Any\ndef filter_integers(values: List[Any]) -> List[int]:\n \"\"\" Filter given list of any python values only for integers\n >>> filter_integers(['a', 3.14, 5])\n [5]\n >>> filter_integers([1, 2, 3, 'abc', {}, []])\n [1, 2, 3]\n \"\"\"\n return [v for v in values if isinstance(v, int) and not isinstance(v, bool)]", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/15": [{"task_id": "HumanEval/15", "solution": "def string_sequence(n: int) -> str:\n \"\"\" Return a string containing space-delimited numbers starting from 0 upto n inclusive.\n >>> string_sequence(0)\n '0'\n >>> string_sequence(5)\n '0 1 2 3 4 5'\n \"\"\"\n return ' '.join(str(i) for i in range(n + 1))", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/23": [{"task_id": "HumanEval/23", "solution": "def strlen(string: str) -> int:\n \"\"\" Return length of given string\n >>> strlen('')\n 0\n >>> strlen('abc')\n 3\n \"\"\"\n return len(string)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/28": [{"task_id": "HumanEval/28", "solution": "from typing import List\ndef concatenate(strings: List[str]) -> str:\n \"\"\" Concatenate list of strings into a single string\n >>> concatenate([])\n ''\n >>> concatenate(['a', 'b', 'c'])\n 'abc'\n \"\"\"\n return ''.join(strings)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/26": [{"task_id": "HumanEval/26", "solution": "from typing import List\ndef remove_duplicates(numbers: List[int]) -> List[int]:\n \"\"\" From a list of integers, remove all elements that occur more than once.\n Keep order of elements left the same as in the input.\n >>> remove_duplicates([1, 2, 3, 2, 4])\n [1, 3, 4]\n \"\"\"\n # Count occurrences of each number\n count = {}\n for num in numbers:\n count[num] = count.get(num, 0) + 1\n \n # Keep only numbers that occur exactly once, preserving order\n result = [num for num in numbers if count[num] == 1]\n \n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/27": [{"task_id": "HumanEval/27", "solution": "def flip_case(string: str) -> str:\n \"\"\" For a given string, flip lowercase characters to uppercase and uppercase to lowercase.\n >>> flip_case('Hello')\n 'hELLO'\n \"\"\"\n return string.swapcase()", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/25": [{"task_id": "HumanEval/25", "solution": "from typing import List\ndef factorize(n: int) -> List[int]:\n \"\"\" Return list of prime factors of given integer in the order from smallest to largest.\n Each of the factors should be listed number of times corresponding to how many times it appeares in factorization.\n Input number should be equal to the product of all factors\n >>> factorize(8)\n [2, 2, 2]\n >>> factorize(25)\n [5, 5]\n >>> factorize(70)\n [2, 5, 7]\n \"\"\"\n if n < 2:\n return []\n \n factors = []\n d = 2\n while d * d <= n:\n while n % d == 0:\n factors.append(d)\n n //= d\n d += 1\n if n > 1:\n factors.append(n)\n \n return factors", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/29": [{"task_id": "HumanEval/29", "solution": "from typing import List\ndef filter_by_prefix(strings: List[str], prefix: str) -> List[str]:\n \"\"\" Filter an input list of strings only for ones that start with a given prefix.\n >>> filter_by_prefix([], 'a')\n []\n >>> filter_by_prefix(['abc', 'bcd', 'cde', 'array'], 'a')\n ['abc', 'array']\n \"\"\"\n return [s for s in strings if s.startswith(prefix)]", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/24": [{"task_id": "HumanEval/24", "solution": "def largest_divisor(n: int) -> int:\n \"\"\" For a given number n, find the largest number that divides n evenly, smaller than n\n >>> largest_divisor(15)\n 5\n \"\"\"\n if n <= 1:\n return 1\n # Start from n-1 and go down to 1, return the first divisor found\n for i in range(n - 1, 0, -1):\n if n % i == 0:\n return i\n return 1", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/30": [{"task_id": "HumanEval/30", "solution": "def get_positive(l: list):\n \"\"\"Return only positive numbers in the list.\n >>> get_positive([-1, 2, -4, 5, 6])\n [2, 5, 6]\n >>> get_positive([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])\n [5, 3, 2, 3, 9, 123, 1]\n \"\"\"\n return [x for x in l if x > 0]", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/34": [{"task_id": "HumanEval/34", "solution": "def unique(l: list):\n \"\"\"Return sorted unique elements in a list\n >>> unique([5, 3, 5, 2, 3, 3, 9, 0, 123])\n [0, 2, 3, 5, 9, 123]\n \"\"\"\n return sorted(set(l))", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/31": [{"task_id": "HumanEval/31", "solution": "def is_prime(n):\n \"\"\"Return true if a given number is prime, and false otherwise.\n >>> is_prime(6)\n False\n >>> is_prime(101)\n True\n >>> is_prime(11)\n True\n >>> is_prime(13441)\n True\n >>> is_prime(61)\n True\n >>> is_prime(4)\n False\n >>> is_prime(1)\n False\n \"\"\"\n if n < 2:\n return False\n if n == 2:\n return True\n if n % 2 == 0:\n return False\n i = 3\n while i * i <= n:\n if n % i == 0:\n return False\n i += 2\n return True", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/35": [{"task_id": "HumanEval/35", "solution": "def max_element(l: list):\n \"\"\"Return maximum element in the list.\n >>> max_element([1, 2, 3])\n 3\n >>> max_element([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])\n 123\n \"\"\"\n return max(l)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/33": [{"task_id": "HumanEval/33", "solution": "def sort_third(l: list):\n \"\"\"This function takes a list l and returns a list l' such that\n 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\n to the values of the corresponding indicies of l, but sorted.\n >>> sort_third([1, 2, 3])\n [1, 2, 3]\n >>> sort_third([5, 6, 3, 4, 8, 9, 2])\n [2, 6, 3, 4, 8, 9, 5]\n \"\"\"\n # Extract elements at indices divisible by 3\n third_indices = [i for i in range(len(l)) if i % 3 == 0]\n third_values = [l[i] for i in third_indices]\n \n # Sort the extracted values\n third_values_sorted = sorted(third_values)\n \n # Create the result list as a copy of the original\n result = list(l)\n \n # Place the sorted values back into the indices divisible by 3\n for idx, i in enumerate(third_indices):\n result[i] = third_values_sorted[idx]\n \n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/32": [{"task_id": "HumanEval/32", "solution": "import math\ndef poly(xs: list, x: float):\n \"\"\"\n Evaluates polynomial with coefficients xs at point x.\n return xs[0] + xs[1] * x + xs[1] * x^2 + .... xs[n] * x^n\n \"\"\"\n return sum([coeff * math.pow(x, i) for i, coeff in enumerate(xs)])\ndef find_zero(xs: list):\n \"\"\" xs are coefficients of a polynomial.\n find_zero find x such that poly(x) = 0.\n find_zero returns only only zero point, even if there are many.\n Moreover, find_zero only takes list xs having even number of coefficients\n and largest non zero coefficient as it guarantees\n a solution.\n >>> round(find_zero([1, 2]), 2) # f(x) = 1 + 2x\n -0.5\n >>> round(find_zero([-6, 11, -6, 1]), 2) # (x - 1) * (x - 2) * (x - 3) = -6 + 11x - 6x^2 + x^3\n 1.0\n \"\"\"\n # Use Newton's method to find a root\n # Start with an initial guess\n x = 0.0\n \n # Compute the derivative coefficients\n # If poly is xs[0] + xs[1]*x + xs[2]*x^2 + ... + xs[n]*x^n\n # Then derivative is xs[1] + 2*xs[2]*x + 3*xs[3]*x^2 + ... + n*xs[n]*x^(n-1)\n def deriv(xs, x):\n return sum([i * coeff * math.pow(x, i - 1) for i, coeff in enumerate(xs) if i > 0])\n \n # Newton's method iteration\n for _ in range(1000):\n fx = poly(xs, x)\n dfx = deriv(xs, x)\n if abs(dfx) < 1e-10:\n # Avoid division by zero, perturb x slightly\n x += 0.001\n continue\n x_new = x - fx / dfx\n if abs(x_new - x) < 1e-10:\n break\n x = x_new\n \n return x", "base_status": "pass", "plus_status": "fail", "base_fail_tests": [], "plus_fail_tests": [[[9450000, 9, -7, 3, 2, 6, 1, -4, -10, 6, 17, -1]]]}], "HumanEval/37": [{"task_id": "HumanEval/37", "solution": "def sort_even(l: list):\n \"\"\"This function takes a list l and returns a list l' such that\n l' is identical to l in the odd indicies, while its values at the even indicies are equal\n to the values of the even indicies of l, but sorted.\n >>> sort_even([1, 2, 3])\n [1, 2, 3]\n >>> sort_even([5, 6, 3, 4])\n [3, 6, 5, 4]\n \"\"\"\n # Extract values at even indices\n even_indices = [i for i in range(0, len(l), 2)]\n even_values = [l[i] for i in even_indices]\n \n # Sort the even-indexed values\n even_values_sorted = sorted(even_values)\n \n # Create the result list\n result = list(l)\n \n # Place sorted even values back into even indices\n for idx, val in zip(even_indices, even_values_sorted):\n result[idx] = val\n \n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/38": [{"task_id": "HumanEval/38", "solution": "def decode_cyclic(s: str):\n \"\"\"\n takes as input string encoded with encode_cyclic function. Returns decoded string.\n \"\"\"\n # To decode, we need to reverse the cyclic shift.\n # Encoding: for each group of 3, we did group[1:] + group[0]\n # So if original was [a, b, c], encoded is [b, c, a]\n # To decode [b, c, a], we need to get [a, b, c]\n # That means: decoded group = encoded_group[2:] + encoded_group[:2]\n # i.e., take the last character and put it at the front.\n \n # Split into groups of 3\n groups = [s[(3 * i):min((3 * i + 3), len(s))] for i in range((len(s) + 2) // 3)]\n # Reverse the cycle: for groups of length 3, move last char to front\n groups = [(group[-1:] + group[:-1]) if len(group) == 3 else group for group in groups]\n return \"\".join(groups)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/36": [{"task_id": "HumanEval/36", "solution": "def fizz_buzz(n: int):\n \"\"\"Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.\n >>> fizz_buzz(50)\n 0\n >>> fizz_buzz(78)\n 2\n >>> fizz_buzz(79)\n 3\n \"\"\"\n count = 0\n for i in range(1, n):\n if i % 11 == 0 or i % 13 == 0:\n # Count the number of 7s in the string representation of i\n count += str(i).count('7')\n return count", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/41": [{"task_id": "HumanEval/41", "solution": "def car_race_collision(n: int):\n \"\"\"\n Imagine a road that's a perfectly straight infinitely long line.\n n cars are driving left to right; simultaneously, a different set of n cars\n are driving right to left. The two sets of cars start out being very far from\n each other. All cars move in the same speed. Two cars are said to collide\n when a car that's moving left to right hits a car that's moving right to left.\n However, the cars are infinitely sturdy and strong; as a result, they continue moving\n in their trajectory as if they did not collide.\n\n This function outputs the number of such collisions.\n \"\"\"\n # Each of the n cars going left-to-right will collide with each of the n cars going right-to-left.\n # Since all cars move at the same speed and start far apart, every left-to-right car will eventually\n # meet every right-to-left car exactly once.\n # Therefore, the total number of collisions is n * n.\n return n * n", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/43": [{"task_id": "HumanEval/43", "solution": "def pairs_sum_to_zero(l):\n \"\"\"\n pairs_sum_to_zero takes a list of integers as an input.\n it returns True if there are two distinct elements in the list that\n sum to zero, and False otherwise.\n >>> pairs_sum_to_zero([1, 3, 5, 0])\n False\n >>> pairs_sum_to_zero([1, 3, -2, 1])\n False\n >>> pairs_sum_to_zero([1, 2, 3, 7])\n False\n >>> pairs_sum_to_zero([2, 4, -5, 3, 5, 7])\n True\n >>> pairs_sum_to_zero([1])\n False\n \"\"\"\n seen = set()\n for num in l:\n if -num in seen:\n return True\n seen.add(num)\n return False", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/40": [{"task_id": "HumanEval/40", "solution": "def triples_sum_to_zero(l: list):\n \"\"\"\n triples_sum_to_zero takes a list of integers as an input.\n it returns True if there are three distinct elements in the list that\n sum to zero, and False otherwise.\n\n >>> triples_sum_to_zero([1, 3, 5, 0])\n False\n >>> triples_sum_to_zero([1, 3, -2, 1])\n True\n >>> triples_sum_to_zero([1, 2, 3, 7])\n False\n >>> triples_sum_to_zero([2, 4, -5, 3, 9, 7])\n True\n >>> triples_sum_to_zero([1])\n False\n \"\"\"\n n = len(l)\n if n < 3:\n return False\n \n # Use a set to track seen pairs for O(n^2) approach\n # For each element, check if there exist two other elements that sum to -l[i]\n for i in range(n):\n seen = set()\n target = -l[i]\n for j in range(i + 1, n):\n complement = target - l[j]\n if complement in seen:\n return True\n seen.add(l[j])\n \n return False", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/42": [{"task_id": "HumanEval/42", "solution": "def incr_list(l: list):\n \"\"\"Return list with elements incremented by 1.\n >>> incr_list([1, 2, 3])\n [2, 3, 4]\n >>> incr_list([5, 3, 5, 2, 3, 3, 9, 0, 123])\n [6, 4, 6, 3, 4, 4, 10, 1, 124]\n \"\"\"\n return [x + 1 for x in l]", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/44": [{"task_id": "HumanEval/44", "solution": "def change_base(x: int, base: int):\n \"\"\"Change numerical base of input number x to base.\n return string representation after the conversion.\n base numbers are less than 10.\n >>> change_base(8, 3)\n '22'\n >>> change_base(8, 2)\n '1000'\n >>> change_base(7, 2)\n '111'\n \"\"\"\n if x == 0:\n return '0'\n \n digits = []\n negative = x < 0\n x = abs(x)\n \n while x > 0:\n digits.append(str(x % base))\n x //= base\n \n if negative:\n digits.append('-')\n \n return ''.join(reversed(digits))", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/46": [{"task_id": "HumanEval/46", "solution": "def fib4(n: int):\n \"\"\"The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:\n fib4(0) -> 0\n fib4(1) -> 0\n fib4(2) -> 2\n fib4(3) -> 0\n fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).\n Please write a function to efficiently compute the n-th element of the fib4 number sequence. Do not use recursion.\n >>> fib4(5)\n 4\n >>> fib4(6)\n 8\n >>> fib4(7)\n 14\n \"\"\"\n if n == 0:\n return 0\n if n == 1:\n return 0\n if n == 2:\n return 2\n if n == 3:\n return 0\n \n # Initialize the first four values\n a, b, c, d = 0, 0, 2, 0 # fib4(0), fib4(1), fib4(2), fib4(3)\n \n for i in range(4, n + 1):\n # fib4(i) = fib4(i-1) + fib4(i-2) + fib4(i-3) + fib4(i-4)\n next_val = a + b + c + d\n a, b, c, d = b, c, d, next_val\n \n return d", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/45": [{"task_id": "HumanEval/45", "solution": "def triangle_area(a, h):\n \"\"\"Given length of a side and high return area for a triangle.\n >>> triangle_area(5, 3)\n 7.5\n \"\"\"\n return 0.5 * a * h", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/47": [{"task_id": "HumanEval/47", "solution": "def median(l: list):\n \"\"\"Return median of elements in the list l.\n >>> median([3, 1, 2, 4, 5])\n 3\n >>> median([-10, 4, 6, 1000, 10, 20])\n 15.0\n \"\"\"\n if not l:\n raise ValueError(\"Cannot compute median of an empty list\")\n sorted_l = sorted(l)\n n = len(sorted_l)\n mid = n // 2\n if n % 2 == 1:\n return sorted_l[mid]\n else:\n return (sorted_l[mid - 1] + sorted_l[mid]) / 2", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/50": [{"task_id": "HumanEval/50", "solution": "def decode_shift(s: str):\n \"\"\"\n takes as input string encoded with encode_shift function. Returns decoded string.\n \"\"\"\n return \"\".join([chr(((ord(ch) - 5 - ord(\"a\")) % 26) + ord(\"a\")) for ch in s])", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/48": [{"task_id": "HumanEval/48", "solution": "def is_palindrome(text: str):\n \"\"\"\n Checks if given string is a palindrome\n >>> is_palindrome('')\n True\n >>> is_palindrome('aba')\n True\n >>> is_palindrome('aaaaa')\n True\n >>> is_palindrome('zbcd')\n False\n \"\"\"\n return text == text[::-1]", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/49": [{"task_id": "HumanEval/49", "solution": "def modp(n: int, p: int):\n \"\"\"Return 2^n modulo p (be aware of numerics).\n >>> modp(3, 5)\n 3\n >>> modp(1101, 101)\n 2\n >>> modp(0, 101)\n 1\n >>> modp(3, 11)\n 8\n >>> modp(100, 101)\n 1\n \"\"\"\n return pow(2, n, p)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/51": [{"task_id": "HumanEval/51", "solution": "def remove_vowels(text):\n \"\"\"\n remove_vowels is a function that takes string and returns string without vowels.\n >>> remove_vowels('')\n ''\n >>> remove_vowels(\"abcdef\\nghijklm\")\n 'bcdf\\nghjklm'\n >>> remove_vowels('abcdef')\n 'bcdf'\n >>> remove_vowels('aaaaa')\n ''\n >>> remove_vowels('aaBAA')\n 'B'\n >>> remove_vowels('zbcd')\n 'zbcd'\n \"\"\"\n vowels = set('aeiouAEIOU')\n return ''.join(char for char in text if char not in vowels)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/52": [{"task_id": "HumanEval/52", "solution": "def below_threshold(l: list, t: int):\n \"\"\"Return True if all numbers in the list l are below threshold t.\n >>> below_threshold([1, 2, 4, 10], 100)\n True\n >>> below_threshold([1, 20, 4, 10], 5)\n False\n \"\"\"\n return all(x < t for x in l)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/53": [{"task_id": "HumanEval/53", "solution": "def add(x: int, y: int):\n \"\"\"Add two numbers x and y\n >>> add(2, 3)\n 5\n >>> add(5, 7)\n 12\n \"\"\"\n return x + y", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/55": [{"task_id": "HumanEval/55", "solution": "def fib(n: int):\n \"\"\"Return n-th Fibonacci number.\n >>> fib(10)\n 55\n >>> fib(1)\n 1\n >>> fib(8)\n 21\n \"\"\"\n if n <= 0:\n return 0\n elif n == 1:\n return 1\n a, b = 0, 1\n for _ in range(2, n + 1):\n a, b = b, a + b\n return b", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/56": [{"task_id": "HumanEval/56", "solution": "def correct_bracketing(brackets: str):\n \"\"\" brackets is a string of \"<\" and \">\".\n return True if every opening bracket has a corresponding closing bracket.\n\n >>> correct_bracketing(\"<\")\n False\n >>> correct_bracketing(\"<>\")\n True\n >>> correct_bracketing(\"<<><>>\")\n True\n >>> correct_bracketing(\"><<>\")\n False\n \"\"\"\n count = 0\n for char in brackets:\n if char == '<':\n count += 1\n elif char == '>':\n count -= 1\n if count < 0:\n return False\n return count == 0", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/54": [{"task_id": "HumanEval/54", "solution": "def same_chars(s0: str, s1: str):\n \"\"\"\n Check if two words have the same characters.\n >>> same_chars('eabcdzzzz', 'dddzzzzzzzddeddabc')\n True\n >>> same_chars('abcd', 'dddddddabc')\n True\n >>> same_chars('dddddddabc', 'abcd')\n True\n >>> same_chars('eabcd', 'dddddddabc')\n False\n >>> same_chars('abcd', 'dddddddabce')\n False\n >>> same_chars('eabcdzzzz', 'dddzzzzzzzddddabc')\n False\n \"\"\"\n return set(s0) == set(s1)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/57": [{"task_id": "HumanEval/57", "solution": "def monotonic(l: list):\n \"\"\"Return True is list elements are monotonically increasing or decreasing.\n >>> monotonic([1, 2, 4, 20])\n True\n >>> monotonic([1, 20, 4, 10])\n False\n >>> monotonic([4, 1, 0, -10])\n True\n \"\"\"\n if len(l) <= 1:\n return True\n \n # Check if monotonically increasing\n increasing = all(l[i] <= l[i+1] for i in range(len(l)-1))\n \n # Check if monotonically decreasing\n decreasing = all(l[i] >= l[i+1] for i in range(len(l)-1))\n \n return increasing or decreasing", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/58": [{"task_id": "HumanEval/58", "solution": "def common(l1: list, l2: list):\n \"\"\"Return sorted unique common elements for two lists.\n >>> common([1, 4, 3, 34, 653, 2, 5], [5, 7, 1, 5, 9, 653, 121])\n [1, 5, 653]\n >>> common([5, 3, 2, 8], [3, 2])\n [2, 3]\n\n \"\"\"\n set1 = set(l1)\n set2 = set(l2)\n common_elements = set1 & set2\n return sorted(list(common_elements))", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/60": [{"task_id": "HumanEval/60", "solution": "def sum_to_n(n: int):\n \"\"\"sum_to_n is a function that sums numbers from 1 to n.\n >>> sum_to_n(30)\n 465\n >>> sum_to_n(100)\n 5050\n >>> sum_to_n(5)\n 15\n >>> sum_to_n(10)\n 55\n >>> sum_to_n(1)\n 1\n \"\"\"\n return n * (n + 1) // 2", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/59": [{"task_id": "HumanEval/59", "solution": "def largest_prime_factor(n: int):\n \"\"\"Return the largest prime factor of n. Assume n > 1 and is not a prime.\n >>> largest_prime_factor(13195)\n 29\n >>> largest_prime_factor(2048)\n 2\n \"\"\"\n largest = -1\n \n # Divide out all factors of 2\n while n % 2 == 0:\n largest = 2\n n //= 2\n \n # Now n must be odd, check odd factors from 3 upwards\n i = 3\n while i * i <= n:\n while n % i == 0:\n largest = i\n n //= i\n i += 2\n \n # If n is still greater than 1, then it is a prime factor\n if n > 1:\n largest = n\n \n return largest", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/63": [{"task_id": "HumanEval/63", "solution": "def fibfib(n: int):\n \"\"\"The FibFib number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:\n fibfib(0) == 0\n fibfib(1) == 0\n fibfib(2) == 1\n fibfib(n) == fibfib(n-1) + fibfib(n-2) + fibfib(n-3).\n Please write a function to efficiently compute the n-th element of the fibfib number sequence.\n >>> fibfib(1)\n 0\n >>> fibfib(5)\n 4\n >>> fibfib(8)\n 24\n \"\"\"\n if n == 0:\n return 0\n if n == 1:\n return 0\n if n == 2:\n return 1\n \n # Use iterative approach for efficiency\n a, b, c = 0, 0, 1 # fibfib(0), fibfib(1), fibfib(2)\n for _ in range(3, n + 1):\n a, b, c = b, c, a + b + c\n return c", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/61": [{"task_id": "HumanEval/61", "solution": "def correct_bracketing(brackets: str):\n \"\"\" brackets is a string of \"(\" and \")\".\n return True if every opening bracket has a corresponding closing bracket.\n\n >>> correct_bracketing(\"(\")\n False\n >>> correct_bracketing(\"()\")\n True\n >>> correct_bracketing(\"(()())\")\n True\n >>> correct_bracketing(\")(()\")\n False\n \"\"\"\n count = 0\n for char in brackets:\n if char == '(':\n count += 1\n elif char == ')':\n count -= 1\n if count < 0:\n return False\n return count == 0", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/62": [{"task_id": "HumanEval/62", "solution": "def derivative(xs: list):\n \"\"\" xs represent coefficients of a polynomial.\n xs[0] + xs[1] * x + xs[2] * x^2 + ....\n Return derivative of this polynomial in the same form.\n >>> derivative([3, 1, 2, 4, 5])\n [1, 4, 12, 20]\n >>> derivative([1, 2, 3])\n [2, 6]\n \"\"\"\n if len(xs) <= 1:\n return []\n result = []\n for i in range(1, len(xs)):\n result.append(xs[i] * i)\n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/64": [{"task_id": "HumanEval/64", "solution": "def vowels_count(s):\n \"\"\"Write a function vowels_count which takes a string representing\n a word as input and returns the number of vowels in the string.\n Vowels in this case are 'a', 'e', 'i', 'o', 'u'. Here, 'y' is also a\n vowel, but only when it is at the end of the given word.\n\n Example:\n >>> vowels_count(\"abcde\")\n 2\n >>> vowels_count(\"ACEDY\")\n 3\n \"\"\"\n vowels = set('aeiouAEIOU')\n count = 0\n for i, char in enumerate(s):\n if char in vowels:\n count += 1\n elif char in 'yY' and i == len(s) - 1:\n count += 1\n return count", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/67": [{"task_id": "HumanEval/67", "solution": "def fruit_distribution(s, n):\n \"\"\"\n In this task, you will be given a string that represents a number of apples and oranges \n that are distributed in a basket of fruit this basket contains \n apples, oranges, and mango fruits. Given the string that represents the total number of \n the oranges and apples and an integer that represent the total number of the fruits \n in the basket return the number of the mango fruits in the basket.\n for examble:\n fruit_distribution(\"5 apples and 6 oranges\", 19) ->19 - 5 - 6 = 8\n fruit_distribution(\"0 apples and 1 oranges\",3) -> 3 - 0 - 1 = 2\n fruit_distribution(\"2 apples and 3 oranges\", 100) -> 100 - 2 - 3 = 95\n fruit_distribution(\"100 apples and 1 oranges\",120) -> 120 - 100 - 1 = 19\n \"\"\"\n # Parse the string to extract the number of apples and oranges\n # The format is: \" apples and oranges\"\n parts = s.split()\n # parts[0] is the number of apples, parts[2] is the number of oranges (since \"and\" is at index 1)\n apples = int(parts[0])\n oranges = int(parts[2])\n mangoes = n - apples - oranges\n return mangoes", "base_status": "fail", "plus_status": "fail", "base_fail_tests": [["5 apples and 6 oranges", 19]], "plus_fail_tests": [["10 apples and 20 oranges", 50]]}], "HumanEval/65": [{"task_id": "HumanEval/65", "solution": "def circular_shift(x, shift):\n \"\"\"Circular shift the digits of the integer x, shift the digits right by shift\n and return the result as a string.\n If shift > number of digits, return digits reversed.\n >>> circular_shift(12, 1)\n '21'\n >>> circular_shift(12, 2)\n '12'\n \"\"\"\n s = str(x)\n n = len(s)\n \n if shift > n:\n return s[::-1]\n \n # Circular right shift by 'shift' positions\n shift = shift % n # Handle cases where shift is a multiple of n\n if shift == 0:\n return s\n \n # Right circular shift: last 'shift' digits move to the front\n return s[-shift:] + s[:-shift]", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/66": [{"task_id": "HumanEval/66", "solution": "def digitSum(s):\n \"\"\"Task\n Write a function that takes a string as input and returns the sum of the upper characters only'\n ASCII codes.\n\n Examples:\n digitSum(\"\") => 0\n digitSum(\"abAB\") => 131\n digitSum(\"abcCd\") => 67\n digitSum(\"helloE\") => 69\n digitSum(\"woArBld\") => 131\n digitSum(\"aAaaaXa\") => 153\n \"\"\"\n return sum(ord(c) for c in s if c.isupper())", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/39": [{"task_id": "HumanEval/39", "solution": "def prime_fib(n: int):\n \"\"\"\n prime_fib returns n-th number that is a Fibonacci number and it's also prime.\n >>> prime_fib(1)\n 2\n >>> prime_fib(2)\n 3\n >>> prime_fib(3)\n 5\n >>> prime_fib(4)\n 13\n >>> prime_fib(5)\n 89\n \"\"\"\n \n def is_prime(num: int) -> bool:\n if num < 2:\n return False\n if num == 2:\n return True\n if num % 2 == 0:\n return False\n i = 3\n while i * i <= num:\n if num % i == 0:\n return False\n i += 2\n return True\n \n def fibonacci_generator():\n a, b = 0, 1\n while True:\n yield a\n a, b = b, a + b\n \n count = 0\n for fib_num in fibonacci_generator():\n if is_prime(fib_num):\n count += 1\n if count == n:\n return fib_num", "base_status": "pass", "plus_status": "fail", "base_fail_tests": [], "plus_fail_tests": [[12]]}], "HumanEval/71": [{"task_id": "HumanEval/71", "solution": "def triangle_area(a, b, c):\n '''\n Given the lengths of the three sides of a triangle. Return the area of\n the triangle rounded to 2 decimal points if the three sides form a valid triangle. \n Otherwise return -1\n Three sides make a valid triangle when the sum of any two sides is greater \n than the third side.\n Example:\n triangle_area(3, 4, 5) == 6.00\n triangle_area(1, 2, 10) == -1\n '''\n # Check if the sides form a valid triangle\n if a <= 0 or b <= 0 or c <= 0:\n return -1\n if (a + b <= c) or (a + c <= b) or (b + c <= a):\n return -1\n \n # Use Heron's formula to calculate the area\n s = (a + b + c) / 2 # semi-perimeter\n area = (s * (s - a) * (s - b) * (s - c)) ** 0.5\n \n return round(area, 2)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/68": [{"task_id": "HumanEval/68", "solution": "def pluck(arr):\n \"\"\"\n \"Given an array representing a branch of a tree that has non-negative integer nodes\n your task is to pluck one of the nodes and return it.\n The plucked node should be the node with the smallest even value.\n If multiple nodes with the same smallest even value are found return the node that has smallest index.\n\n The plucked node should be returned in a list, [ smalest_value, its index ],\n If there are no even values or the given array is empty, return [].\n\n Example 1:\n Input: [4,2,3]\n Output: [2, 1]\n Explanation: 2 has the smallest even value, and 2 has the smallest index.\n\n Example 2:\n Input: [1,2,3]\n Output: [2, 1]\n Explanation: 2 has the smallest even value, and 2 has the smallest index. \n\n Example 3:\n Input: []\n Output: []\n \n Example 4:\n Input: [5, 0, 3, 0, 4, 2]\n Output: [0, 1]\n Explanation: 0 is the smallest value, but there are two zeros,\n so we will choose the first zero, which has the smallest index.\n\n Constraints:\n * 1 <= nodes.length <= 10000\n * 0 <= node.value\n \"\"\"\n if not arr:\n return []\n \n min_even = None\n min_index = None\n \n for i, val in enumerate(arr):\n if val % 2 == 0:\n if min_even is None or val < min_even:\n min_even = val\n min_index = i\n \n if min_even is None:\n return []\n \n return [min_even, min_index]", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/70": [{"task_id": "HumanEval/70", "solution": "def strange_sort_list(lst):\n '''\n Given list of integers, return list in strange order.\n Strange sorting, is when you start with the minimum value,\n then maximum of the remaining integers, then minimum and so on.\n\n Examples:\n strange_sort_list([1, 2, 3, 4]) == [1, 4, 2, 3]\n strange_sort_list([5, 5, 5, 5]) == [5, 5, 5, 5]\n strange_sort_list([]) == []\n '''\n if not lst:\n return []\n \n sorted_lst = sorted(lst)\n result = []\n left = 0\n right = len(sorted_lst) - 1\n pick_min = True\n \n while left <= right:\n if pick_min:\n result.append(sorted_lst[left])\n left += 1\n else:\n result.append(sorted_lst[right])\n right -= 1\n pick_min = not pick_min\n \n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/69": [{"task_id": "HumanEval/69", "solution": "def search(lst):\n '''\n You are given a non-empty list of positive integers. Return the greatest integer that is greater than \n zero, and has a frequency greater than or equal to the value of the integer itself. \n The frequency of an integer is the number of times it appears in the list.\n If no such a value exist, return -1.\n Examples:\n search([4, 1, 2, 2, 3, 1]) == 2\n search([1, 2, 2, 3, 3, 3, 4, 4, 4]) == 3\n search([5, 5, 4, 4, 4]) == -1\n '''\n from collections import Counter\n \n freq = Counter(lst)\n \n result = -1\n \n for num, count in freq.items():\n if num > 0 and count >= num:\n if num > result:\n result = num\n \n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/72": [{"task_id": "HumanEval/72", "solution": "def will_it_fly(q, w):\n '''\n Write a function that returns True if the object q will fly, and False otherwise.\n The object q will fly if it's balanced (it is a palindromic list) and the sum of its elements is less than or equal the maximum possible weight w.\n\n Example:\n will_it_fly([1, 2], 5) \u279e False \n # 1+2 is less than the maximum possible weight, but it's unbalanced.\n\n will_it_fly([3, 2, 3], 1) \u279e False\n # it's balanced, but 3+2+3 is more than the maximum possible weight.\n\n will_it_fly([3, 2, 3], 9) \u279e True\n # 3+2+3 is less than the maximum possible weight, and it's balanced.\n\n will_it_fly([3], 5) \u279e True\n # 3 is less than the maximum possible weight, and it's balanced.\n '''\n # Check if the list is palindromic (balanced)\n is_balanced = q == q[::-1]\n # Check if the sum of elements is less than or equal to w\n is_within_weight = sum(q) <= w\n return is_balanced and is_within_weight", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/73": [{"task_id": "HumanEval/73", "solution": "def smallest_change(arr):\n \"\"\"\n Given an array arr of integers, find the minimum number of elements that\n need to be changed to make the array palindromic. A palindromic array is an array that\n is read the same backwards and forwards. In one change, you can change one element to any other element.\n\n For example:\n smallest_change([1,2,3,5,4,7,9,6]) == 4\n smallest_change([1, 2, 3, 4, 3, 2, 2]) == 1\n smallest_change([1, 2, 3, 2, 1]) == 0\n \"\"\"\n n = len(arr)\n changes = 0\n left = 0\n right = n - 1\n while left < right:\n if arr[left] != arr[right]:\n changes += 1\n left += 1\n right -= 1\n return changes", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/74": [{"task_id": "HumanEval/74", "solution": "def total_match(lst1, lst2):\n '''\n Write a function that accepts two lists of strings and returns the list that has \n total number of chars in the all strings of the list less than the other list.\n\n if the two lists have the same number of chars, return the first list.\n\n Examples\n total_match([], []) \u279e []\n total_match(['hi', 'admin'], ['hI', 'Hi']) \u279e ['hI', 'Hi']\n total_match(['hi', 'admin'], ['hi', 'hi', 'admin', 'project']) \u279e ['hi', 'admin']\n total_match(['hi', 'admin'], ['hI', 'hi', 'hi']) \u279e ['hI', 'hi', 'hi']\n total_match(['4'], ['1', '2', '3', '4', '5']) \u279e ['4']\n '''\n def total_chars(lst):\n return sum(len(s) for s in lst)\n \n chars1 = total_chars(lst1)\n chars2 = total_chars(lst2)\n \n if chars1 <= chars2:\n return lst1\n else:\n return lst2", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/75": [{"task_id": "HumanEval/75", "solution": "def is_multiply_prime(a):\n \"\"\"Write a function that returns true if the given number is the multiplication of 3 prime numbers\n and false otherwise.\n Knowing that (a) is less then 100. \n Example:\n is_multiply_prime(30) == True\n 30 = 2 * 3 * 5\n \"\"\"\n \n def is_prime(n):\n if n < 2:\n return False\n if n == 2:\n return True\n if n % 2 == 0:\n return False\n for i in range(3, int(n**0.5) + 1, 2):\n if n % i == 0:\n return False\n return True\n \n # We need to check if a can be expressed as the product of exactly 3 prime numbers\n # The primes don't have to be distinct\n \n # Generate all primes up to 100\n primes = [p for p in range(2, 100) if is_prime(p)]\n \n # Check all combinations of 3 primes (with repetition allowed) whose product equals a\n for i in range(len(primes)):\n for j in range(i, len(primes)):\n for k in range(j, len(primes)):\n product = primes[i] * primes[j] * primes[k]\n if product == a:\n return True\n if product > a:\n break\n \n return False", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/79": [{"task_id": "HumanEval/79", "solution": "def decimal_to_binary(decimal):\n \"\"\"You will be given a number in decimal form and your task is to convert it to\n binary format. The function should return a string, with each character representing a binary\n number. Each character in the string will be '0' or '1'.\n\n There will be an extra couple of characters 'db' at the beginning and at the end of the string.\n The extra characters are there to help with the format.\n\n Examples:\n decimal_to_binary(15) # returns \"db1111db\"\n decimal_to_binary(32) # returns \"db100000db\"\n \"\"\"\n if decimal == 0:\n return \"db0db\"\n \n # Convert to binary, removing the '0b' prefix\n binary_str = bin(decimal)[2:]\n \n return \"db\" + binary_str + \"db\"", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/77": [{"task_id": "HumanEval/77", "solution": "def iscube(a):\n '''\n Write a function that takes an integer a and returns True \n if this ingeger is a cube of some integer number.\n Note: you may assume the input is always valid.\n Examples:\n iscube(1) ==> True\n iscube(2) ==> False\n iscube(-1) ==> True\n iscube(64) ==> True\n iscube(0) ==> True\n iscube(180) ==> False\n '''\n if a == 0:\n return True\n # Compute the cube root\n if a > 0:\n cube_root = round(a ** (1/3))\n else:\n cube_root = -round(abs(a) ** (1/3))\n # Check if cube_root cubed equals a\n return cube_root ** 3 == a", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/76": [{"task_id": "HumanEval/76", "solution": "def is_simple_power(x, n):\n \"\"\"Your task is to write a function that returns true if a number x is a simple\n power of n and false in other cases.\n x is a simple power of n if n**int=x\n For example:\n is_simple_power(1, 4) => true\n is_simple_power(2, 2) => true\n is_simple_power(8, 2) => true\n is_simple_power(3, 2) => false\n is_simple_power(3, 1) => false\n is_simple_power(5, 3) => false\n \"\"\"\n # Handle edge cases\n if n == 0:\n # 0**k = 0 for k > 0, and 0**0 is typically 1\n # So x must be 0 (with some positive exponent) or 1 (with exponent 0)\n # But 0**0 is ambiguous. Let's say x == 0 is true (0 = 0**1), x == 1 could be 0**0 but that's debatable.\n # Looking at examples, let's handle carefully.\n if x == 0:\n return True\n elif x == 1:\n # 0**0 = 1 in Python, so this could be considered true\n return True\n else:\n return False\n \n if n == 1:\n # 1**k = 1 for any k, so only x == 1 is a simple power\n return x == 1\n \n if n == -1:\n # (-1)**k = 1 if k is even, -1 if k is odd\n # So x must be 1 or -1\n return x == 1 or x == -1\n \n # For other values of n, we need to check if there exists an integer k >= 0 such that n**k == x\n # We can iterate through possible exponents\n \n # Handle x == 1: n**0 = 1 for any n != 0, so return True\n if x == 1:\n return True\n \n # If x == 0, n**k = 0 only if n == 0 (already handled) or impossible for n != 0\n if x == 0:\n return False\n \n # For positive n > 1, we can check by repeated multiplication\n # For negative n, we need to be more careful\n \n # Let's try iterating through possible exponents\n # We need to find if there's an integer k such that n**k == x\n \n # Start with k = 0, 1, 2, ... until n**k exceeds |x| in magnitude\n # But we also need to consider negative exponents? The problem says \"int\" which likely means non-negative integer exponent.\n # Looking at examples: is_simple_power(1, 4) => true, which is 4**0 = 1\n \n # Let's iterate through non-negative integer exponents\n power = 1 # n**0\n k = 0\n while True:\n if power == x:\n return True\n # Check if we've gone past x in magnitude\n if abs(power) > abs(x):\n return False\n # Compute next power\n power *= n\n k += 1\n # Safety check to avoid infinite loops\n if k > 1000:\n return False", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/78": [{"task_id": "HumanEval/78", "solution": "def hex_key(num):\n \"\"\"You have been tasked to write a function that receives \n a hexadecimal number as a string and counts the number of hexadecimal \n digits that are primes (prime number, or a prime, is a natural number \n greater than 1 that is not a product of two smaller natural numbers).\n Hexadecimal digits are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F.\n Prime numbers are 2, 3, 5, 7, 11, 13, 17,...\n So you have to determine a number of the following digits: 2, 3, 5, 7, \n B (=decimal 11), D (=decimal 13).\n Note: you may assume the input is always correct or empty string, \n and symbols A,B,C,D,E,F are always uppercase.\n Examples:\n For num = \"AB\" the output should be 1.\n For num = \"1077E\" the output should be 2.\n For num = \"ABED1A33\" the output should be 4.\n For num = \"123456789ABCDEF0\" the output should be 6.\n For num = \"2020\" the output should be 2.\n \"\"\"\n prime_hex_digits = {'2', '3', '5', '7', 'B', 'D'}\n count = 0\n for digit in num:\n if digit in prime_hex_digits:\n count += 1\n return count", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/81": [{"task_id": "HumanEval/81", "solution": "def numerical_letter_grade(grades):\n \"\"\"It is the last week of the semester and the teacher has to give the grades\n to students. The teacher has been making her own algorithm for grading.\n The only problem is, she has lost the code she used for grading.\n She has given you a list of GPAs for some students and you have to write \n a function that can output a list of letter grades using the following table:\n GPA | Letter grade\n 4.0 A+\n > 3.7 A \n > 3.3 A- \n > 3.0 B+\n > 2.7 B \n > 2.3 B-\n > 2.0 C+\n > 1.7 C\n > 1.3 C-\n > 1.0 D+ \n > 0.7 D \n > 0.0 D-\n 0.0 E\n \n\n Example:\n grade_equation([4.0, 3, 1.7, 2, 3.5]) ==> ['A+', 'B', 'C-', 'C', 'A-']\n \"\"\"\n def gpa_to_letter(gpa):\n if gpa == 4.0:\n return 'A+'\n elif gpa > 3.7:\n return 'A'\n elif gpa > 3.3:\n return 'A-'\n elif gpa > 3.0:\n return 'B+'\n elif gpa > 2.7:\n return 'B'\n elif gpa > 2.3:\n return 'B-'\n elif gpa > 2.0:\n return 'C+'\n elif gpa > 1.7:\n return 'C'\n elif gpa > 1.3:\n return 'C-'\n elif gpa > 1.0:\n return 'D+'\n elif gpa > 0.7:\n return 'D'\n elif gpa > 0.0:\n return 'D-'\n else:\n return 'E'\n \n return [gpa_to_letter(gpa) for gpa in grades]", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/80": [{"task_id": "HumanEval/80", "solution": "def is_happy(s):\n \"\"\"You are given a string s.\n Your task is to check if the string is happy or not.\n A string is happy if its length is at least 3 and every 3 consecutive letters are distinct\n For example:\n is_happy(a) => False\n is_happy(aa) => False\n is_happy(abcd) => True\n is_happy(aabb) => False\n is_happy(adb) => True\n is_happy(xyy) => False\n \"\"\"\n if len(s) < 3:\n return False\n for i in range(len(s) - 2):\n if s[i] == s[i+1] or s[i] == s[i+2] or s[i+1] == s[i+2]:\n return False\n return True", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/82": [{"task_id": "HumanEval/82", "solution": "def prime_length(string):\n \"\"\"Write a function that takes a string and returns True if the string\n length is a prime number or False otherwise\n Examples\n prime_length('Hello') == True\n prime_length('abcdcba') == True\n prime_length('kittens') == True\n prime_length('orange') == False\n \"\"\"\n n = len(string)\n \n # Numbers less than 2 are not prime\n if n < 2:\n return False\n \n # Check if n is prime\n for i in range(2, int(n**0.5) + 1):\n if n % i == 0:\n return False\n \n return True", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/87": [{"task_id": "HumanEval/87", "solution": "def get_row(lst, x):\n \"\"\"\n You are given a 2 dimensional data, as a nested lists,\n which is similar to matrix, however, unlike matrices,\n each row may contain a different number of columns.\n Given lst, and integer x, find integers x in the list,\n and return list of tuples, [(x1, y1), (x2, y2) ...] such that\n each tuple is a coordinate - (row, columns), starting with 0.\n Sort coordinates initially by rows in ascending order.\n Also, sort coordinates of the row by columns in descending order.\n \n Examples:\n get_row([\n [1,2,3,4,5,6],\n [1,2,3,4,1,6],\n [1,2,3,4,5,1]\n ], 1) == [(0, 0), (1, 4), (1, 0), (2, 5), (2, 0)]\n get_row([], 1) == []\n get_row([[], [1], [1, 2, 3]], 3) == [(2, 2)]\n \"\"\"\n result = []\n for row_idx, row in enumerate(lst):\n # Find all column indices where x appears in this row\n col_indices = [col_idx for col_idx, val in enumerate(row) if val == x]\n # Sort column indices in descending order\n col_indices.sort(reverse=True)\n for col_idx in col_indices:\n result.append((row_idx, col_idx))\n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/86": [{"task_id": "HumanEval/86", "solution": "def anti_shuffle(s):\n \"\"\"\n Write a function that takes a string and returns an ordered version of it.\n Ordered version of string, is a string where all words (separated by space)\n are replaced by a new word where all the characters arranged in\n ascending order based on ascii value.\n Note: You should keep the order of words and blank spaces in the sentence.\n\n For example:\n anti_shuffle('Hi') returns 'Hi'\n anti_shuffle('hello') returns 'ehllo'\n anti_shuffle('Hello World!!!') returns 'Hello !!!Wdlor'\n \"\"\"\n # Split the string by spaces, but we need to preserve the structure\n # The problem says words are separated by space, and we keep order of words and blank spaces.\n # Looking at the example: 'Hello World!!!' -> 'Hello !!!Wdlor'\n # Wait, let me re-read. \"Hello World!!!\" has two words: \"Hello\" and \"World!!!\"\n # \"Hello\" sorted: 'Hello' -> sorted chars: 'H','e','l','l','o' -> 'Hello' (already sorted? H=72, e=101, l=108, l=108, o=111 -> 'Hello')\n # \"World!!!\" sorted: 'W','o','r','l','d','!','!' -> ASCII: '!'=33, '!'=33, 'W'=87, 'd'=100, 'l'=108, 'o'=111, 'r'=114 -> '!!Wdlor'\n # So the result is 'Hello !!!Wdlor' which matches.\n \n # So we split by spaces, sort each word's characters, and join with spaces.\n words = s.split(' ')\n sorted_words = []\n for word in words:\n sorted_word = ''.join(sorted(word))\n sorted_words.append(sorted_word)\n return ' '.join(sorted_words)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/85": [{"task_id": "HumanEval/85", "solution": "def add(lst):\n \"\"\"Given a non-empty list of integers lst. add the even elements that are at odd indices..\n\n\n Examples:\n add([4, 2, 6, 7]) ==> 2 \n \"\"\"\n total = 0\n for i in range(1, len(lst), 2): # odd indices: 1, 3, 5, ...\n if lst[i] % 2 == 0: # even elements\n total += lst[i]\n return total", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/84": [{"task_id": "HumanEval/84", "solution": "def solve(N):\n \"\"\"Given a positive integer N, return the total sum of its digits in binary.\n \n Example\n For N = 1000, the sum of digits will be 1 the output should be \"1\".\n For N = 150, the sum of digits will be 6 the output should be \"110\".\n For N = 147, the sum of digits will be 12 the output should be \"1100\".\n \n Variables:\n @N integer\n Constraints: 0 \u2264 N \u2264 10000.\n Output:\n a string of binary number\n \"\"\"\n # Calculate the sum of digits of N\n digit_sum = sum(int(d) for d in str(N))\n \n # Convert the sum to binary string (without '0b' prefix)\n if digit_sum == 0:\n return \"0\"\n return bin(digit_sum)[2:]", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/89": [{"task_id": "HumanEval/89", "solution": "def encrypt(s):\n \"\"\"Create a function encrypt that takes a string as an argument and\n returns a string encrypted with the alphabet being rotated. \n The alphabet should be rotated in a manner such that the letters \n shift down by two multiplied to two places.\n For example:\n encrypt('hi') returns 'lm'\n encrypt('asdfghjkl') returns 'ewhjklnop'\n encrypt('gf') returns 'kj'\n encrypt('et') returns 'ix'\n \"\"\"\n result = []\n for char in s:\n if char.isalpha():\n # Determine the base (uppercase or lowercase)\n if char.isupper():\n base = ord('A')\n else:\n base = ord('a')\n # Shift by 4 (two multiplied by two = 4)\n shifted = (ord(char) - base + 4) % 26 + base\n result.append(chr(shifted))\n else:\n result.append(char)\n return ''.join(result)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/88": [{"task_id": "HumanEval/88", "solution": "def sort_array(array):\n \"\"\"\n Given an array of non-negative integers, return a copy of the given array after sorting,\n you will sort the given array in ascending order if the sum( first index value, last index value) is odd,\n or sort it in descending order if the sum( first index value, last index value) is even.\n\n Note:\n * don't change the given array.\n\n Examples:\n * sort_array([]) => []\n * sort_array([5]) => [5]\n * sort_array([2, 4, 3, 0, 1, 5]) => [0, 1, 2, 3, 4, 5]\n * sort_array([2, 4, 3, 0, 1, 5, 6]) => [6, 5, 4, 3, 2, 1, 0]\n \"\"\"\n if not array:\n return []\n \n # Create a copy to avoid modifying the original array\n arr_copy = list(array)\n \n # Get first and last index values\n first_value = arr_copy[0]\n last_value = arr_copy[-1]\n \n # Calculate the sum of first and last index values\n total = first_value + last_value\n \n # Sort in ascending order if sum is odd, descending if even\n if total % 2 == 1:\n # Odd sum -> ascending order\n arr_copy.sort()\n else:\n # Even sum -> descending order\n arr_copy.sort(reverse=True)\n \n return arr_copy", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/90": [{"task_id": "HumanEval/90", "solution": "def next_smallest(lst):\n \"\"\"\n You are given a list of integers.\n Write a function next_smallest() that returns the 2nd smallest element of the list.\n Return None if there is no such element.\n \n next_smallest([1, 2, 3, 4, 5]) == 2\n next_smallest([5, 1, 4, 3, 2]) == 2\n next_smallest([]) == None\n next_smallest([1, 1]) == None\n \"\"\"\n if not lst:\n return None\n \n # Get unique elements and sort them\n unique_sorted = sorted(set(lst))\n \n if len(unique_sorted) < 2:\n return None\n \n return unique_sorted[1]", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/91": [{"task_id": "HumanEval/91", "solution": "def is_bored(S):\n \"\"\"\n You'll be given a string of words, and your task is to count the number\n of boredoms. A boredom is a sentence that starts with the word \"I\".\n Sentences are delimited by '.', '?' or '!'.\n \n For example:\n >>> is_bored(\"Hello world\")\n 0\n >>> is_bored(\"The sky is blue. The sun is shining. I love this weather\")\n 1\n \"\"\"\n if not S:\n return 0\n \n # Split the string into sentences by '.', '?' or '!'\n # We need to split on these delimiters and keep track of sentence boundaries\n import re\n \n # Split the string by sentence-ending punctuation\n # We'll use regex to split on '.', '?' or '!'\n sentences = re.split(r'[.?!]', S)\n \n count = 0\n for sentence in sentences:\n # Strip leading and trailing whitespace\n stripped = sentence.strip()\n if not stripped:\n continue\n # Check if the sentence starts with \"I\"\n # The first word should be exactly \"I\"\n # We need to check if the sentence starts with \"I\" followed by a space or end of string\n # But we need to be careful: \"I\" as a standalone word at the start\n if stripped.startswith(\"I\"):\n # Check if \"I\" is a complete word (followed by space, end of string, or punctuation)\n # Since we already split on punctuation, the sentence shouldn't start with punctuation\n # Check if the second character is a space or the string is just \"I\"\n if len(stripped) == 1:\n # Just \"I\"\n count += 1\n elif len(stripped) > 1 and stripped[1] == ' ':\n # \"I\" followed by a space\n count += 1\n # If it's \"I\" followed by something else (like \"Ice\"), it's not the word \"I\"\n \n return count", "base_status": "pass", "plus_status": "fail", "base_fail_tests": [], "plus_fail_tests": [["I"]]}], "HumanEval/92": [{"task_id": "HumanEval/92", "solution": "def any_int(x, y, z):\n '''\n Create a function that takes 3 numbers.\n Returns true if one of the numbers is equal to the sum of the other two, and all numbers are integers.\n Returns false in any other cases.\n \n Examples\n any_int(5, 2, 7) \u279e True\n \n any_int(3, 2, 2) \u279e False\n\n any_int(3, -2, 1) \u279e True\n \n any_int(3.6, -2.2, 2) \u279e False\n \n '''\n # Check if all numbers are integers\n if not (isinstance(x, int) and isinstance(y, int) and isinstance(z, int)):\n # Also handle booleans since bool is a subclass of int in Python\n if isinstance(x, bool) or isinstance(y, bool) or isinstance(z, bool):\n return False\n # Check if floats that are whole numbers should be considered? \n # The problem says \"all numbers are integers\", so we need to check if they are actual integers.\n # But the example shows 3.6, -2.2, 2 returns False, so non-integer floats should return False.\n # However, what about 3.0? Let's check: isinstance(3.0, int) is False, so it would return False.\n # The problem likely means mathematical integers, so we should check if the values are integer-valued.\n # Let's re-read: \"all numbers are integers\". This likely means they must be of integer type or represent integer values.\n # To be safe, let's check if each number is an integer (either int type or float with no fractional part).\n pass\n \n # Let's properly check if all three are integers (mathematically)\n def is_integer(n):\n if isinstance(n, bool):\n return False\n if isinstance(n, int):\n return True\n if isinstance(n, float):\n return n == int(n)\n return False\n \n if not (is_integer(x) and is_integer(y) and is_integer(z)):\n return False\n \n # Now check if one number equals the sum of the other two\n if x == y + z:\n return True\n if y == x + z:\n return True\n if z == x + y:\n return True\n \n return False", "base_status": "fail", "plus_status": "pass", "base_fail_tests": [[3.0, 4, 7]], "plus_fail_tests": []}], "HumanEval/93": [{"task_id": "HumanEval/93", "solution": "def encode(message):\n \"\"\"\n Write a function that takes a message, and encodes in such a \n way that it swaps case of all letters, replaces all vowels in \n the message with the letter that appears 2 places ahead of that \n vowel in the english alphabet. \n Assume only letters. \n \n Examples:\n >>> encode('test')\n 'TGST'\n >>> encode('This is a message')\n 'tHKS KS C MGSSCGG'\n \"\"\"\n vowels = set('aeiouAEIOU')\n # Mapping for vowels shifted by 2 places ahead, then case-swapped\n # For lowercase vowels: a->c, e->g, i->k, o->q, u->w\n # For uppercase vowels: A->C, E->G, I->K, O->Q, U->W\n # But we also swap case, so:\n # If original is lowercase vowel, we shift by 2, then swap case (make uppercase)\n # If original is uppercase vowel, we shift by 2, then swap case (make lowercase)\n \n vowel_shift = {\n 'a': 'C', 'e': 'G', 'i': 'K', 'o': 'Q', 'u': 'W',\n 'A': 'c', 'E': 'g', 'I': 'k', 'O': 'q', 'U': 'w'\n }\n \n result = []\n for char in message:\n if char in vowels:\n result.append(vowel_shift[char])\n else:\n # Swap case for non-vowel letters\n if char.islower():\n result.append(char.upper())\n elif char.isupper():\n result.append(char.lower())\n else:\n # Non-letter characters (though problem says assume only letters)\n result.append(char)\n \n return ''.join(result)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/95": [{"task_id": "HumanEval/95", "solution": "def check_dict_case(dict):\n \"\"\"\n Given a dictionary, return True if all keys are strings in lower \n case or all keys are strings in upper case, else return False.\n The function should return False is the given dictionary is empty.\n Examples:\n check_dict_case({\"a\":\"apple\", \"b\":\"banana\"}) should return True.\n check_dict_case({\"a\":\"apple\", \"A\":\"banana\", \"B\":\"banana\"}) should return False.\n check_dict_case({\"a\":\"apple\", 8:\"banana\", \"a\":\"apple\"}) should return False.\n check_dict_case({\"Name\":\"John\", \"Age\":\"36\", \"City\":\"Houston\"}) should return False.\n check_dict_case({\"STATE\":\"NC\", \"ZIP\":\"12345\" }) should return True.\n \"\"\"\n if not dict:\n return False\n \n keys = list(dict.keys())\n \n # Check if all keys are strings\n if not all(isinstance(k, str) for k in keys):\n return False\n \n # Check if all keys are lowercase or all keys are uppercase\n all_lower = all(k.islower() for k in keys)\n all_upper = all(k.isupper() for k in keys)\n \n return all_lower or all_upper", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/97": [{"task_id": "HumanEval/97", "solution": "def multiply(a, b):\n \"\"\"Complete the function that takes two integers and returns \n the product of their unit digits.\n Assume the input is always valid.\n Examples:\n multiply(148, 412) should return 16.\n multiply(19, 28) should return 72.\n multiply(2020, 1851) should return 0.\n multiply(14,-15) should return 20.\n \"\"\"\n unit_a = abs(a) % 10\n unit_b = abs(b) % 10\n return unit_a * unit_b", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/96": [{"task_id": "HumanEval/96", "solution": "def count_up_to(n):\n \"\"\"Implement a function that takes an non-negative integer and returns an array of the first n\n integers that are prime numbers and less than n.\n for example:\n count_up_to(5) => [2,3]\n count_up_to(11) => [2,3,5,7]\n count_up_to(0) => []\n count_up_to(20) => [2,3,5,7,11,13,17,19]\n count_up_to(1) => []\n count_up_to(18) => [2,3,5,7,11,13,17]\n \"\"\"\n if n <= 2:\n return []\n \n def is_prime(num):\n if num < 2:\n return False\n if num == 2:\n return True\n if num % 2 == 0:\n return False\n for i in range(3, int(num**0.5) + 1, 2):\n if num % i == 0:\n return False\n return True\n \n primes = []\n for num in range(2, n):\n if is_prime(num):\n primes.append(num)\n \n return primes", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/94": [{"task_id": "HumanEval/94", "solution": "def skjkasdkd(lst):\n \"\"\"You are given a list of integers.\n You need to find the largest prime value and return the sum of its digits.\n\n Examples:\n 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\n For lst = [1,0,1,8,2,4597,2,1,3,40,1,2,1,2,4,2,5,1] the output should be 25\n For lst = [1,3,1,32,5107,34,83278,109,163,23,2323,32,30,1,9,3] the output should be 13\n For lst = [0,724,32,71,99,32,6,0,5,91,83,0,5,6] the output should be 11\n For lst = [0,81,12,3,1,21] the output should be 3\n For lst = [0,8,1,2,1,7] the output should be 7\n \"\"\"\n \n def is_prime(n):\n \"\"\"Check if a number is prime.\"\"\"\n if n < 2:\n return False\n if n == 2:\n return True\n if n % 2 == 0:\n return False\n i = 3\n while i * i <= n:\n if n % i == 0:\n return False\n i += 2\n return True\n \n def sum_of_digits(n):\n \"\"\"Return the sum of digits of a number.\"\"\"\n return sum(int(d) for d in str(abs(n)))\n \n # Find all prime numbers in the list\n primes = [x for x in lst if is_prime(x)]\n \n if not primes:\n return 0\n \n # Find the largest prime\n largest_prime = max(primes)\n \n # Return the sum of its digits\n return sum_of_digits(largest_prime)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/98": [{"task_id": "HumanEval/98", "solution": "def count_upper(s):\n \"\"\"\n Given a string s, count the number of uppercase vowels in even indices.\n \n For example:\n count_upper('aBCdEf') returns 1\n count_upper('abcdefg') returns 0\n count_upper('dBBE') returns 0\n \"\"\"\n uppercase_vowels = set('AEIOU')\n count = 0\n for i in range(0, len(s), 2):\n if s[i] in uppercase_vowels:\n count += 1\n return count", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/99": [{"task_id": "HumanEval/99", "solution": "def closest_integer(value):\n '''\n Create a function that takes a value (string) representing a number\n and returns the closest integer to it. If the number is equidistant\n from two integers, round it away from zero.\n\n Examples\n >>> closest_integer(\"10\")\n 10\n >>> closest_integer(\"15.3\")\n 15\n\n Note:\n Rounding away from zero means that if the given number is equidistant\n from two integers, the one you should return is the one that is the\n farthest from zero. For example closest_integer(\"14.5\") should\n return 15 and closest_integer(\"-14.5\") should return -15.\n '''\n num = float(value)\n \n if num >= 0:\n # For positive numbers, round half up\n import math\n return math.floor(num + 0.5)\n else:\n # For negative numbers, round half down (away from zero)\n import math\n return math.ceil(num - 0.5)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/83": [{"task_id": "HumanEval/83", "solution": "def starts_one_ends(n):\n \"\"\"\n Given a positive integer n, return the count of the numbers of n-digit\n positive integers that start or end with 1.\n \"\"\"\n if n <= 0:\n return 0\n \n if n == 1:\n # For 1-digit numbers, the only number that starts or ends with 1 is 1 itself.\n return 1\n \n # For n-digit numbers:\n # - Numbers that start with 1: The first digit is 1, and the remaining (n-1) digits can be anything from 0-9.\n # So there are 10^(n-1) such numbers.\n # - Numbers that end with 1: The last digit is 1, and the first digit can be 1-9 (can't be 0 for n-digit number),\n # and the middle (n-2) digits can be anything from 0-9.\n # So there are 9 * 10^(n-2) such numbers.\n # - But we've double-counted numbers that both start AND end with 1.\n # Numbers that start with 1 and end with 1: first digit is 1, last digit is 1, middle (n-2) digits can be anything.\n # So there are 10^(n-2) such numbers.\n # By inclusion-exclusion: count = starts_with_1 + ends_with_1 - both_start_and_end_with_1\n \n starts_with_1 = 10 ** (n - 1)\n ends_with_1 = 9 * (10 ** (n - 2))\n both = 10 ** (n - 2)\n \n return starts_with_1 + ends_with_1 - both", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/100": [{"task_id": "HumanEval/100", "solution": "def make_a_pile(n):\n \"\"\"\n Given a positive integer n, you have to make a pile of n levels of stones.\n The first level has n stones.\n The number of stones in the next level is:\n - the next odd number if n is odd.\n - the next even number if n is even.\n Return the number of stones in each level in a list, where element at index\n i represents the number of stones in the level (i+1).\n\n Examples:\n >>> make_a_pile(3)\n [3, 5, 7]\n \"\"\"\n if n <= 0:\n return []\n \n result = []\n current = n\n \n for i in range(n):\n result.append(current)\n if current % 2 == 1:\n # next odd number\n current += 2\n else:\n # next even number\n current += 2\n \n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/101": [{"task_id": "HumanEval/101", "solution": "def words_string(s):\n \"\"\"\n You will be given a string of words separated by commas or spaces. Your task is\n to split the string into words and return an array of the words.\n \n For example:\n words_string(\"Hi, my name is John\") == [\"Hi\", \"my\", \"name\", \"is\", \"John\"]\n words_string(\"One, two, three, four, five, six\") == [\"One\", \"two\", \"three\", \"four\", \"five\", \"six\"]\n \"\"\"\n # Replace commas with spaces, then split by whitespace\n s = s.replace(',', ' ')\n # Split by whitespace and filter out empty strings\n words = [word for word in s.split() if word]\n return words", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/102": [{"task_id": "HumanEval/102", "solution": "def choose_num(x, y):\n \"\"\"This function takes two positive numbers x and y and returns the\n biggest even integer number that is in the range [x, y] inclusive. If \n there's no such number, then the function should return -1.\n\n For example:\n choose_num(12, 15) = 14\n choose_num(13, 12) = -1\n \"\"\"\n # Ensure x <= y; if not, there's no valid range\n if x > y:\n return -1\n \n # Start from the largest number in the range and go downwards\n # Find the biggest even number in [x, y]\n start = y\n if start % 2 != 0:\n start -= 1\n \n if start < x:\n return -1\n \n return start", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/103": [{"task_id": "HumanEval/103", "solution": "def rounded_avg(n, m):\n \"\"\"You are given two positive integers n and m, and your task is to compute the\n average of the integers from n through m (including n and m). \n Round the answer to the nearest integer and convert that to binary.\n If n is greater than m, return -1.\n Example:\n rounded_avg(1, 5) => \"0b11\"\n rounded_avg(7, 5) => -1\n rounded_avg(10, 20) => \"0b1111\"\n rounded_avg(20, 33) => \"0b11010\"\n \"\"\"\n if n > m:\n return -1\n \n # Compute the average of integers from n through m\n # The sum of integers from n to m is (n + m) * (m - n + 1) / 2\n # The average is sum / count = (n + m) / 2\n avg = (n + m) / 2\n \n # Round to the nearest integer\n rounded = round(avg)\n \n # Convert to binary string with '0b' prefix\n return bin(rounded)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/104": [{"task_id": "HumanEval/104", "solution": "def unique_digits(x):\n \"\"\"Given a list of positive integers x. return a sorted list of all \n elements that hasn't any even digit.\n\n Note: Returned list should be sorted in increasing order.\n \n For example:\n >>> unique_digits([15, 33, 1422, 1])\n [1, 15, 33]\n >>> unique_digits([152, 323, 1422, 10])\n []\n \"\"\"\n def has_no_even_digit(n):\n # Check if all digits in n are odd\n for digit in str(n):\n if int(digit) % 2 == 0:\n return False\n return True\n \n result = [num for num in x if has_no_even_digit(num)]\n result.sort()\n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/106": [{"task_id": "HumanEval/106", "solution": "def f(n):\n \"\"\" Implement the function f that takes n as a parameter,\n 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\n or the sum of numbers from 1 to i otherwise.\n i starts from 1.\n the factorial of i is the multiplication of the numbers from 1 to i (1 * 2 * ... * i).\n Example:\n f(5) == [1, 2, 6, 24, 15]\n \"\"\"\n result = []\n for i in range(1, n + 1):\n if i % 2 == 0:\n # Factorial of i\n factorial = 1\n for j in range(1, i + 1):\n factorial *= j\n result.append(factorial)\n else:\n # Sum of numbers from 1 to i\n total = sum(range(1, i + 1))\n result.append(total)\n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/105": [{"task_id": "HumanEval/105", "solution": "def by_length(arr):\n \"\"\"\n Given an array of integers, sort the integers that are between 1 and 9 inclusive,\n reverse the resulting array, and then replace each digit by its corresponding name from\n \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\".\n\n For example:\n arr = [2, 1, 1, 4, 5, 8, 2, 3] \n -> sort arr -> [1, 1, 2, 2, 3, 4, 5, 8] \n -> reverse arr -> [8, 5, 4, 3, 2, 2, 1, 1]\n return [\"Eight\", \"Five\", \"Four\", \"Three\", \"Two\", \"Two\", \"One\", \"One\"]\n \n If the array is empty, return an empty array:\n arr = []\n return []\n \n If the array has any strange number ignore it:\n arr = [1, -1 , 55] \n -> sort arr -> [-1, 1, 55]\n -> reverse arr -> [55, 1, -1]\n return = ['One']\n \"\"\"\n # Filter numbers between 1 and 9 inclusive\n filtered = [x for x in arr if 1 <= x <= 9]\n \n # Sort the filtered numbers\n filtered.sort()\n \n # Reverse the sorted array\n filtered.reverse()\n \n # Map each number to its corresponding name\n name_map = {\n 1: \"One\",\n 2: \"Two\",\n 3: \"Three\",\n 4: \"Four\",\n 5: \"Five\",\n 6: \"Six\",\n 7: \"Seven\",\n 8: \"Eight\",\n 9: \"Nine\"\n }\n \n result = [name_map[x] for x in filtered]\n \n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/107": [{"task_id": "HumanEval/107", "solution": "def even_odd_palindrome(n):\n \"\"\"\n Given a positive integer n, return a tuple that has the number of even and odd\n integer palindromes that fall within the range(1, n), inclusive.\n\n Example 1:\n\n Input: 3\n Output: (1, 2)\n Explanation:\n Integer palindrome are 1, 2, 3. one of them is even, and two of them are odd.\n\n Example 2:\n\n Input: 12\n Output: (4, 6)\n Explanation:\n Integer palindrome are 1, 2, 3, 4, 5, 6, 7, 8, 9, 11. four of them are even, and 6 of them are odd.\n\n Note:\n 1. 1 <= n <= 10^3\n 2. returned tuple has the number of even and odd integer palindromes respectively.\n \"\"\"\n def is_palindrome(num):\n s = str(num)\n return s == s[::-1]\n \n even_count = 0\n odd_count = 0\n \n for i in range(1, n + 1):\n if is_palindrome(i):\n if i % 2 == 0:\n even_count += 1\n else:\n odd_count += 1\n \n return (even_count, odd_count)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/108": [{"task_id": "HumanEval/108", "solution": "def count_nums(arr):\n \"\"\"\n Write a function count_nums which takes an array of integers and returns\n the number of elements which has a sum of digits > 0.\n If a number is negative, then its first signed digit will be negative:\n e.g. -123 has signed digits -1, 2, and 3.\n >>> count_nums([]) == 0\n >>> count_nums([-1, 11, -11]) == 1\n >>> count_nums([1, 1, 2]) == 3\n \"\"\"\n def signed_digit_sum(n):\n if n == 0:\n return 0\n if n < 0:\n # First digit is negative, rest are positive\n s = str(n) # e.g., \"-123\"\n # The first character is '-', then digits\n # First digit after '-' is negative, rest are positive\n digits = s[1:] # \"123\"\n total = -int(digits[0])\n for d in digits[1:]:\n total += int(d)\n return total\n else:\n # All digits are positive\n total = 0\n for d in str(n):\n total += int(d)\n return total\n \n count = 0\n for num in arr:\n if signed_digit_sum(num) > 0:\n count += 1\n return count", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/109": [{"task_id": "HumanEval/109", "solution": "def move_one_ball(arr):\n \"\"\"We have an array 'arr' of N integers arr[1], arr[2], ..., arr[N].The\n numbers in the array will be randomly ordered. Your task is to determine if\n it is possible to get an array sorted in non-decreasing order by performing \n the following operation on the given array:\n You are allowed to perform right shift operation any number of times.\n \n One right shift operation means shifting all elements of the array by one\n position in the right direction. The last element of the array will be moved to\n the starting position in the array i.e. 0th index. \n\n If it is possible to obtain the sorted array by performing the above operation\n then return True else return False.\n If the given array is empty then return True.\n\n Note: The given list is guaranteed to have unique elements.\n\n For Example:\n \n move_one_ball([3, 4, 5, 1, 2])==>True\n Explanation: By performin 2 right shift operations, non-decreasing order can\n be achieved for the given array.\n move_one_ball([3, 5, 4, 1, 2])==>False\n Explanation:It is not possible to get non-decreasing order for the given\n array by performing any number of right shift operations.\n \n \"\"\"\n if not arr:\n return True\n \n n = len(arr)\n if n <= 1:\n return True\n \n # Count the number of \"breaks\" where arr[i] > arr[i+1] (circularly)\n # For a circularly sorted array (i.e., can be rotated to be sorted),\n # there should be at most one such break.\n \n breaks = 0\n for i in range(n):\n if arr[i] > arr[(i + 1) % n]:\n breaks += 1\n \n return breaks <= 1", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/110": [{"task_id": "HumanEval/110", "solution": "def exchange(lst1, lst2):\n \"\"\"In this problem, you will implement a function that takes two lists of numbers,\n and determines whether it is possible to perform an exchange of elements\n between them to make lst1 a list of only even numbers.\n There is no limit on the number of exchanged elements between lst1 and lst2.\n If it is possible to exchange elements between the lst1 and lst2 to make\n all the elements of lst1 to be even, return \"YES\".\n Otherwise, return \"NO\".\n For example:\n exchange([1, 2, 3, 4], [1, 2, 3, 4]) => \"YES\"\n exchange([1, 2, 3, 4], [1, 5, 3, 4]) => \"NO\"\n It is assumed that the input lists will be non-empty.\n \"\"\"\n # Count how many odd numbers are in lst1\n odd_in_lst1 = [x for x in lst1 if x % 2 != 0]\n # Count how many even numbers are in lst2\n even_in_lst2 = [x for x in lst2 if x % 2 == 0]\n \n # We need to replace all odd numbers in lst1 with even numbers from lst2\n # The number of even numbers available in lst2 must be at least the number of odd numbers in lst1\n if len(even_in_lst2) >= len(odd_in_lst1):\n return \"YES\"\n else:\n return \"NO\"", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/111": [{"task_id": "HumanEval/111", "solution": "def histogram(test):\n \"\"\"Given a string representing a space separated lowercase letters, return a dictionary\n of the letter with the most repetition and containing the corresponding count.\n If several letters have the same occurrence, return all of them.\n \n Example:\n histogram('a b c') == {'a': 1, 'b': 1, 'c': 1}\n histogram('a b b a') == {'a': 2, 'b': 2}\n histogram('a b c a b') == {'a': 2, 'b': 2}\n histogram('b b b b a') == {'b': 4}\n histogram('') == {}\n\n \"\"\"\n if not test or test.strip() == '':\n return {}\n \n # Split the string by spaces to get individual letters\n letters = test.split()\n \n if not letters:\n return {}\n \n # Count occurrences of each letter\n count = {}\n for letter in letters:\n if letter: # Ensure we don't count empty strings\n count[letter] = count.get(letter, 0) + 1\n \n if not count:\n return {}\n \n # Find the maximum count\n max_count = max(count.values())\n \n # Return all letters that have the maximum count\n result = {letter: cnt for letter, cnt in count.items() if cnt == max_count}\n \n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/112": [{"task_id": "HumanEval/112", "solution": "def reverse_delete(s, c):\n \"\"\"Task\n We are given two strings s and c, you have to deleted all the characters in s that are equal to any character in c\n then check if the result string is palindrome.\n A string is called palindrome if it reads the same backward as forward.\n You should return a tuple containing the result string and True/False for the check.\n Example\n For s = \"abcde\", c = \"ae\", the result should be ('bcd',False)\n For s = \"abcdef\", c = \"b\" the result should be ('acdef',False)\n For s = \"abcdedcba\", c = \"ab\", the result should be ('cdedc',True)\n \"\"\"\n # Delete all characters in s that are in c\n result = ''.join(char for char in s if char not in c)\n \n # Check if the result is a palindrome\n is_palindrome = result == result[::-1]\n \n return (result, is_palindrome)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/113": [{"task_id": "HumanEval/113", "solution": "def odd_count(lst):\n \"\"\"Given a list of strings, where each string consists of only digits, return a list.\n Each element i of the output should be \"the number of odd elements in the\n string i of the input.\" where all the i's should be replaced by the number\n of odd digits in the i'th string of the input.\n\n >>> odd_count(['1234567'])\n [\"the number of odd elements 4n the str4ng 4 of the 4nput.\"]\n >>> odd_count(['3',\"11111111\"])\n [\"the number of odd elements 1n the str1ng 1 of the 1nput.\",\n \"the number of odd elements 8n the str8ng 8 of the 8nput.\"]\n \"\"\"\n result = []\n for s in lst:\n # Count the number of odd digits in the string\n odd_digits = [d for d in s if d in '13579']\n count = len(odd_digits)\n # Build the output string with the count replacing 'i'\n output = f\"the number of odd elements {count}n the str{count}ng {count} of the {count}nput.\"\n result.append(output)\n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/114": [{"task_id": "HumanEval/114", "solution": "def minSubArraySum(nums):\n \"\"\"\n Given an array of integers nums, find the minimum sum of any non-empty sub-array\n of nums.\n Example\n minSubArraySum([2, 3, 4, 1, 2, 4]) == 1\n minSubArraySum([-1, -2, -3]) == -6\n \"\"\"\n if not nums:\n return 0\n \n # Kadane's algorithm for minimum subarray sum\n min_ending_here = nums[0]\n min_so_far = nums[0]\n \n for i in range(1, len(nums)):\n # Either extend the previous subarray or start a new one\n min_ending_here = min(nums[i], min_ending_here + nums[i])\n min_so_far = min(min_so_far, min_ending_here)\n \n return min_so_far", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/115": [{"task_id": "HumanEval/115", "solution": "import math\ndef max_fill(grid, capacity):\n \"\"\"\n You are given a rectangular grid of wells. Each row represents a single well,\n and each 1 in a row represents a single unit of water.\n Each well has a corresponding bucket that can be used to extract water from it, \n and all buckets have the same capacity.\n Your task is to use the buckets to empty the wells.\n Output the number of times you need to lower the buckets.\n\n Example 1:\n Input: \n grid : [[0,0,1,0], [0,1,0,0], [1,1,1,1]]\n bucket_capacity : 1\n Output: 6\n\n Example 2:\n Input: \n grid : [[0,0,1,1], [0,0,0,0], [1,1,1,1], [0,1,1,1]]\n bucket_capacity : 2\n Output: 5\n \n Example 3:\n Input: \n grid : [[0,0,0], [0,0,0]]\n bucket_capacity : 5\n Output: 0\n\n Constraints:\n * all wells have the same length\n * 1 <= grid.length <= 10^2\n * 1 <= grid[:,1].length <= 10^2\n * grid[i][j] -> 0 | 1\n * 1 <= capacity <= 10\n \"\"\"\n total_drops = 0\n for well in grid:\n water_units = sum(well)\n if water_units > 0:\n # Number of times to lower the bucket for this well\n drops = math.ceil(water_units / capacity)\n total_drops += drops\n return total_drops", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/116": [{"task_id": "HumanEval/116", "solution": "def sort_array(arr):\n \"\"\"\n In this Kata, you have to sort an array of non-negative integers according to\n number of ones in their binary representation in ascending order.\n For similar number of ones, sort based on decimal value.\n\n It must be implemented like this:\n >>> sort_array([1, 5, 2, 3, 4]) == [1, 2, 3, 4, 5]\n >>> sort_array([-2, -3, -4, -5, -6]) == [-6, -5, -4, -3, -2]\n >>> sort_array([1, 0, 2, 3, 4]) [0, 1, 2, 3, 4]\n \"\"\"\n def count_ones(n):\n # For negative numbers, we need to handle them specially.\n # The problem says \"non-negative integers\" but the example includes negatives.\n # Looking at the example: sort_array([-2, -3, -4, -5, -6]) == [-6, -5, -4, -3, -2]\n # This suggests that for negative numbers, we sort by their decimal value (ascending).\n # Let's think about this: the problem statement says \"non-negative integers\" but the test case has negatives.\n # For negative numbers, the binary representation in Python uses two's complement with infinite leading 1s,\n # which doesn't make sense for counting ones. So likely, for negative numbers, we just sort by value.\n # Let's check: -6, -5, -4, -3, -2 are in ascending order. So for negatives, it seems like they're sorted by value.\n # For non-negative, we sort by number of ones, then by value.\n if n < 0:\n # For negative numbers, we can't really count ones in a meaningful way for this problem.\n # Based on the example, negatives are sorted by their decimal value.\n # We'll use a large number of ones to push them, but actually let's think differently.\n # The example shows negatives sorted in ascending order: -6 < -5 < -4 < -3 < -2\n # So for negatives, we just sort by value. For non-negatives, sort by ones then value.\n # We can handle this by using a key that separates negatives and non-negatives.\n return (1, n) # Use a tuple where first element distinguishes negatives\n else:\n return (0, bin(n).count('1'), n)\n \n # Actually, let me reconsider. The problem says \"non-negative integers\" but the test has negatives.\n # Let me look at the expected output more carefully.\n # For [1, 5, 2, 3, 4]: \n # 1 = 1 (1 one), 5 = 101 (2 ones), 2 = 10 (1 one), 3 = 11 (2 ones), 4 = 100 (1 one)\n # Sorted by ones: 1,2,4 have 1 one; 3,5 have 2 ones\n # Within 1 one: 1,2,4 sorted by value -> 1,2,4\n # Within 2 ones: 3,5 sorted by value -> 3,5\n # Result: [1,2,4,3,5] but expected is [1,2,3,4,5]\n # Hmm, that doesn't match. Let me recount:\n # 1: 1 -> 1 one\n # 5: 101 -> 2 ones\n # 2: 10 -> 1 one\n # 3: 11 -> 2 ones\n # 4: 100 -> 1 one\n # So by ones: group 1: [1,2,4], group 2: [3,5]\n # Sorted: [1,2,4,3,5] but expected [1,2,3,4,5]\n # Wait, the expected output is [1,2,3,4,5]. Let me re-read...\n # Actually wait, maybe I'm misunderstanding. Let me check if the expected output in the docstring is correct.\n # The docstring says sort_array([1, 5, 2, 3, 4]) == [1, 2, 3, 4, 5]\n # But based on the rules, it should be [1, 2, 4, 3, 5]. \n # Hmm, perhaps the docstring example is wrong, or perhaps I need to re-read the problem.\n # Actually, looking at typical Kata problems, the expected behavior for [1,5,2,3,4] with sorting by number of ones then by value would be [1,2,4,3,5].\n # But the docstring says [1,2,3,4,5]. This is confusing.\n # Let me just implement the logic as described: sort by number of ones ascending, then by decimal value ascending.\n \n def sort_key(n):\n if n < 0:\n # For negative numbers, based on the example, they should be sorted by value ascending\n # To keep negatives separate and sorted by value, use a key that puts them first or last appropriately\n # The example [-2,-3,-4,-5,-6] -> [-6,-5,-4,-3,-2] which is ascending order\n # So for negatives, we want them sorted by value. Let's use a key that handles this.\n return (0, 0, n) # This won't work well. Let me think again.\n else:\n return (1, bin(n).count('1'), n)\n \n # Actually, let me just implement it straightforwardly:\n # For all numbers, sort by (number_of_ones, value). For negatives, we need to define number_of_ones.\n # Since the problem mentions non-negative but tests have negatives, let's handle negatives by their value only.\n \n def key_func(n):\n if n < 0:\n # For negatives, sort by value. Use a special key to keep them in order.\n # We want negatives to be sorted by value ascending.\n # Let's use a tuple that ensures negatives come before non-negatives or vice versa.\n # Looking at the examples, it seems like all numbers are mixed. Let me just use value for negatives.\n return (0, n) # First element 0 to group negatives, then by value\n else:\n return (1, bin(n).count('1'), n)\n \n # Hmm, this is getting complicated. Let me just try a simpler approach:\n # Sort by (count_ones, value) for all, where for negatives we define count_ones in a way that works.\n \n # Let me just implement the straightforward version and see:\n def count_bits(n):\n if n < 0:\n # For negative numbers, use a large number so they sort after, or handle separately\n return float('inf')\n return bin(n).count('1')\n \n # Actually, let me look at the second example again: [-2,-3,-4,-5,-6] -> [-6,-5,-4,-3,-2]\n # This is just sorted by value ascending. So for negatives, the \"number of ones\" criterion doesn't apply,\n # and they're just sorted by value. \n \n # Let me separate negatives and non-negatives:\n negatives = [x for x in arr if x < 0]\n non_negatives = [x for x in arr if x >= 0]\n \n # Sort negatives by value\n negatives.sort()\n \n # Sort non-negatives by number of ones, then by value\n non_negatives.sort(key=lambda x: (bin(x).count('1'), x))\n \n return negatives + non_negatives", "base_status": "fail", "plus_status": "pass", "base_fail_tests": [[[-2, -3, -4, -5, -6]]], "plus_fail_tests": []}], "HumanEval/117": [{"task_id": "HumanEval/117", "solution": "def select_words(s, n):\n \"\"\"Given a string s and a natural number n, you have been tasked to implement \n a function that returns a list of all words from string s that contain exactly \n n consonants, in order these words appear in the string s.\n If the string s is empty then the function should return an empty list.\n Note: you may assume the input string contains only letters and spaces.\n Examples:\n select_words(\"Mary had a little lamb\", 4) ==> [\"little\"]\n select_words(\"Mary had a little lamb\", 3) ==> [\"Mary\", \"lamb\"]\n select_words(\"simple white space\", 2) ==> []\n select_words(\"Hello world\", 4) ==> [\"world\"]\n select_words(\"Uncle sam\", 3) ==> [\"Uncle\"]\n \"\"\"\n if not s:\n return []\n \n vowels = set('aeiouAEIOU')\n \n def count_consonants(word):\n count = 0\n for char in word:\n if char.isalpha() and char not in vowels:\n count += 1\n return count\n \n words = s.split()\n result = []\n for word in words:\n if count_consonants(word) == n:\n result.append(word)\n \n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/118": [{"task_id": "HumanEval/118", "solution": "def get_closest_vowel(word):\n \"\"\"You are given a word. Your task is to find the closest vowel that stands between \n two consonants from the right side of the word (case sensitive).\n \n Vowels in the beginning and ending doesn't count. Return empty string if you didn't\n find any vowel met the above condition. \n\n You may assume that the given string contains English letter only.\n\n Example:\n get_closest_vowel(\"yogurt\") ==> \"u\"\n get_closest_vowel(\"FULL\") ==> \"U\"\n get_closest_vowel(\"quick\") ==> \"\"\n get_closest_vowel(\"ab\") ==> \"\"\n \"\"\"\n vowels = set('aeiouAEIOU')\n \n # We need to find a vowel that is between two consonants.\n # \"from the right side\" means we should look from the right and return the first (closest to the right) such vowel.\n # Vowels at the beginning (index 0) and ending (last index) don't count.\n \n # So we need to find a vowel at index i where:\n # - i is not 0 and i is not len(word)-1\n # - word[i] is a vowel\n # - word[i-1] is a consonant (not a vowel)\n # - word[i+1] is a consonant (not a vowel)\n # And we want the one closest to the right side, so we search from right to left.\n \n n = len(word)\n if n < 3:\n return \"\"\n \n # Search from right to left, starting from the second-to-last character down to index 1\n for i in range(n - 2, 0, -1):\n if word[i] in vowels:\n # Check if both neighbors are consonants (i.e., not vowels)\n if word[i - 1] not in vowels and word[i + 1] not in vowels:\n return word[i]\n \n return \"\"", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/119": [{"task_id": "HumanEval/119", "solution": "def match_parens(lst):\n '''\n You are given a list of two strings, both strings consist of open\n parentheses '(' or close parentheses ')' only.\n Your job is to check if it is possible to concatenate the two strings in\n some order, that the resulting string will be good.\n A string S is considered to be good if and only if all parentheses in S\n are balanced. For example: the string '(())()' is good, while the string\n '())' is not.\n Return 'Yes' if there's a way to make a good string, and return 'No' otherwise.\n\n Examples:\n match_parens(['()(', ')']) == 'Yes'\n match_parens([')', ')']) == 'No'\n '''\n \n def is_good(s):\n \"\"\"Check if a string of parentheses is balanced.\"\"\"\n count = 0\n for c in s:\n if c == '(':\n count += 1\n else:\n count -= 1\n if count < 0:\n return False\n return count == 0\n \n # Try both orderings\n s1, s2 = lst[0], lst[1]\n \n # Check s1 + s2\n if is_good(s1 + s2):\n return 'Yes'\n \n # Check s2 + s1\n if is_good(s2 + s1):\n return 'Yes'\n \n return 'No'", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/120": [{"task_id": "HumanEval/120", "solution": "def maximum(arr, k):\n \"\"\"\n Given an array arr of integers and a positive integer k, return a sorted list \n of length k with the maximum k numbers in arr.\n\n Example 1:\n\n Input: arr = [-3, -4, 5], k = 3\n Output: [-4, -3, 5]\n\n Example 2:\n\n Input: arr = [4, -4, 4], k = 2\n Output: [4, 4]\n\n Example 3:\n\n Input: arr = [-3, 2, 1, 2, -1, -2, 1], k = 1\n Output: [2]\n\n Note:\n 1. The length of the array will be in the range of [1, 1000].\n 2. The elements in the array will be in the range of [-1000, 1000].\n 3. 0 <= k <= len(arr)\n \"\"\"\n if k == 0:\n return []\n # Sort the array in ascending order and take the last k elements, then sort them\n sorted_arr = sorted(arr)\n # The maximum k numbers are the last k elements when sorted in ascending order\n max_k = sorted_arr[-k:]\n # Return them sorted in ascending order\n return sorted(max_k)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/122": [{"task_id": "HumanEval/122", "solution": "def add_elements(arr, k):\n \"\"\"\n Given a non-empty array of integers arr and an integer k, return\n the sum of the elements with at most two digits from the first k elements of arr.\n\n Example:\n\n Input: arr = [111,21,3,4000,5,6,7,8,9], k = 4\n Output: 24 # sum of 21 + 3\n\n Constraints:\n 1. 1 <= len(arr) <= 100\n 2. 1 <= k <= len(arr)\n \"\"\"\n total = 0\n for i in range(k):\n num = arr[i]\n # Check if the number has at most two digits\n # A number has at most two digits if its absolute value is less than 100\n if abs(num) < 100:\n total += num\n return total", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/121": [{"task_id": "HumanEval/121", "solution": "def solution(lst):\n \"\"\"Given a non-empty list of integers, return the sum of all of the odd elements that are in even positions.\n \n\n Examples\n solution([5, 8, 7, 1]) ==> 12\n solution([3, 3, 3, 3, 3]) ==> 9\n solution([30, 13, 24, 321]) ==>0\n \"\"\"\n total = 0\n for i in range(0, len(lst), 2):\n if lst[i] % 2 != 0:\n total += lst[i]\n return total", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/123": [{"task_id": "HumanEval/123", "solution": "def get_odd_collatz(n):\n \"\"\"\n Given a positive integer n, return a sorted list that has the odd numbers in collatz sequence.\n\n The Collatz conjecture is a conjecture in mathematics that concerns a sequence defined\n as follows: start with any positive integer n. Then each term is obtained from the \n previous term as follows: if the previous term is even, the next term is one half of \n the previous term. If the previous term is odd, the next term is 3 times the previous\n term plus 1. The conjecture is that no matter what value of n, the sequence will always reach 1.\n\n Note: \n 1. Collatz(1) is [1].\n 2. returned list sorted in increasing order.\n\n For example:\n get_odd_collatz(5) returns [1, 5] # The collatz sequence for 5 is [5, 16, 8, 4, 2, 1], so the odd numbers are only 1, and 5.\n \"\"\"\n if n <= 0:\n raise ValueError(\"n must be a positive integer\")\n \n # Generate the Collatz sequence\n sequence = []\n current = n\n while True:\n sequence.append(current)\n if current == 1:\n break\n if current % 2 == 0:\n current = current // 2\n else:\n current = 3 * current + 1\n \n # Extract odd numbers from the sequence\n odd_numbers = [x for x in sequence if x % 2 != 0]\n \n # Sort in increasing order and remove duplicates\n odd_numbers = sorted(set(odd_numbers))\n \n return odd_numbers", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/124": [{"task_id": "HumanEval/124", "solution": "def valid_date(date):\n \"\"\"You have to write a function which validates a given date string and\n returns True if the date is valid otherwise False.\n The date is valid if all of the following rules are satisfied:\n 1. The date string is not empty.\n 2. The number of days is not less than 1 or higher than 31 days for months 1,3,5,7,8,10,12. And the number of days is not less than 1 or higher than 30 days for months 4,6,9,11. And, the number of days is not less than 1 or higher than 29 for the month 2.\n 3. The months should not be less than 1 or higher than 12.\n 4. The date should be in the format: mm-dd-yyyy\n\n for example: \n valid_date('03-11-2000') => True\n\n valid_date('15-01-2012') => False\n\n valid_date('04-0-2040') => False\n\n valid_date('06-04-2020') => True\n\n valid_date('06/04/2020') => False\n \"\"\"\n # Rule 1: The date string is not empty\n if not date or not isinstance(date, str):\n return False\n \n # Rule 4: The date should be in the format: mm-dd-yyyy\n # Check that the format is exactly mm-dd-yyyy with hyphens\n if len(date) != 10:\n return False\n \n # Check that positions 2 and 5 are hyphens\n if date[2] != '-' or date[5] != '-':\n return False\n \n # Extract month, day, year parts\n month_str = date[0:2]\n day_str = date[3:5]\n year_str = date[6:10]\n \n # Check that all parts are numeric\n if not month_str.isdigit() or not day_str.isdigit() or not year_str.isdigit():\n return False\n \n # Convert to integers\n month = int(month_str)\n day = int(day_str)\n year = int(year_str)\n \n # Rule 3: The months should not be less than 1 or higher than 12\n if month < 1 or month > 12:\n return False\n \n # Rule 2: Check days based on month\n # Months with 31 days: 1, 3, 5, 7, 8, 10, 12\n # Months with 30 days: 4, 6, 9, 11\n # Month 2: up to 29 days (as per the problem statement, not considering leap year specifics beyond 29)\n \n if month in [1, 3, 5, 7, 8, 10, 12]:\n if day < 1 or day > 31:\n return False\n elif month in [4, 6, 9, 11]:\n if day < 1 or day > 30:\n return False\n elif month == 2:\n if day < 1 or day > 29:\n return False\n \n return True", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/125": [{"task_id": "HumanEval/125", "solution": "def split_words(txt):\n '''\n Given a string of words, return a list of words split on whitespace, if no whitespaces exists in the text you\n should split on commas ',' if no commas exists you should return the number of lower-case letters with odd order in the\n alphabet, ord('a') = 0, ord('b') = 1, ... ord('z') = 25\n Examples\n split_words(\"Hello world!\") \u279e [\"Hello\", \"world!\"]\n split_words(\"Hello,world!\") \u279e [\"Hello\", \"world!\"]\n split_words(\"abcdef\") == 3 \n '''\n # Check if there are whitespaces\n if ' ' in txt or '\\t' in txt or '\\n' in txt or '\\r' in txt:\n return txt.split()\n # Check if there are commas\n elif ',' in txt:\n return txt.split(',')\n else:\n # Count lower-case letters with odd order in the alphabet\n # ord('a') = 0, ord('b') = 1, ..., ord('z') = 25\n # So for a character c, its order is ord(c) - ord('a')\n # We want odd orders: 1, 3, 5, ..., 25\n count = 0\n for c in txt:\n if c.islower():\n order = ord(c) - ord('a')\n if order % 2 == 1:\n count += 1\n return count", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/127": [{"task_id": "HumanEval/127", "solution": "def intersection(interval1, interval2):\n \"\"\"You are given two intervals,\n where each interval is a pair of integers. For example, interval = (start, end) = (1, 2).\n The given intervals are closed which means that the interval (start, end)\n includes both start and end.\n For each given interval, it is assumed that its start is less or equal its end.\n Your task is to determine whether the length of intersection of these two \n intervals is a prime number.\n Example, the intersection of the intervals (1, 3), (2, 4) is (2, 3)\n which its length is 1, which not a prime number.\n If the length of the intersection is a prime number, return \"YES\",\n otherwise, return \"NO\".\n If the two intervals don't intersect, return \"NO\".\n\n\n [input/output] samples:\n intersection((1, 2), (2, 3)) ==> \"NO\"\n intersection((-1, 1), (0, 4)) ==> \"NO\"\n intersection((-3, -1), (-5, 5)) ==> \"YES\"\n \"\"\"\n \n def is_prime(n):\n \"\"\"Check if a number is prime.\"\"\"\n if n < 2:\n return False\n if n == 2:\n return True\n if n % 2 == 0:\n return False\n for i in range(3, int(n**0.5) + 1, 2):\n if n % i == 0:\n return False\n return True\n \n # Calculate the intersection of the two intervals\n start1, end1 = interval1\n start2, end2 = interval2\n \n # The intersection starts at the maximum of the two starts\n # and ends at the minimum of the two ends\n inter_start = max(start1, start2)\n inter_end = min(end1, end2)\n \n # Check if there is an intersection\n if inter_start > inter_end:\n return \"NO\"\n \n # The length of the intersection for closed intervals\n # For a closed interval [a, b], the number of integers is (b - a + 1)\n # But the problem says \"length\" - let's check the examples:\n # (1, 3) and (2, 4) intersect at (2, 3), length is 1.\n # If we count integers: 2, 3 -> 2 integers. But they say length is 1.\n # So \"length\" here means (end - start), not the count of integers.\n # Let's verify: (2, 3) -> length = 3 - 2 = 1. That matches.\n # Another example: (-3, -1) and (-5, 5) intersect at (-3, -1).\n # Length = -1 - (-3) = 2. Is 2 prime? Yes. So return \"YES\". That matches.\n # Another: (-1, 1) and (0, 4) intersect at (0, 1). Length = 1 - 0 = 1. Not prime. \"NO\". Matches.\n # Another: (1, 2) and (2, 3) intersect at (2, 2). Length = 2 - 2 = 0. Not prime. \"NO\". Matches.\n \n length = inter_end - inter_start\n \n if is_prime(length):\n return \"YES\"\n else:\n return \"NO\"", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/126": [{"task_id": "HumanEval/126", "solution": "def is_sorted(lst):\n '''\n Given a list of numbers, return whether or not they are sorted\n in ascending order. If list has more than 1 duplicate of the same\n number, return False. Assume no negative numbers and only integers.\n\n Examples\n is_sorted([5]) \u279e True\n is_sorted([1, 2, 3, 4, 5]) \u279e True\n is_sorted([1, 3, 2, 4, 5]) \u279e False\n is_sorted([1, 2, 3, 4, 5, 6]) \u279e True\n is_sorted([1, 2, 3, 4, 5, 6, 7]) \u279e True\n is_sorted([1, 3, 2, 4, 5, 6, 7]) \u279e False\n is_sorted([1, 2, 2, 3, 3, 4]) \u279e True\n is_sorted([1, 2, 2, 2, 3, 4]) \u279e False\n '''\n if len(lst) <= 1:\n return True\n \n # Check for duplicates: if any number appears more than twice, return False\n # Also check that the list is sorted in ascending order\n from collections import Counter\n counts = Counter(lst)\n for count in counts.values():\n if count > 2:\n return False\n \n # Check if sorted in ascending order\n for i in range(len(lst) - 1):\n if lst[i] > lst[i + 1]:\n return False\n \n return True", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/128": [{"task_id": "HumanEval/128", "solution": "def prod_signs(arr):\n \"\"\"\n You are given an array arr of integers and you need to return\n sum of magnitudes of integers multiplied by product of all signs\n of each number in the array, represented by 1, -1 or 0.\n Note: return None for empty arr.\n\n Example:\n >>> prod_signs([1, 2, 2, -4]) == -9\n >>> prod_signs([0, 1]) == 0\n >>> prod_signs([]) == None\n \"\"\"\n if not arr:\n return None\n \n # Calculate the product of signs\n # sign of a number: 1 if positive, -1 if negative, 0 if zero\n sign_product = 1\n for num in arr:\n if num > 0:\n sign_product *= 1\n elif num < 0:\n sign_product *= -1\n else:\n sign_product *= 0\n \n # Calculate the sum of magnitudes\n sum_magnitudes = sum(abs(num) for num in arr)\n \n return sign_product * sum_magnitudes", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/129": [{"task_id": "HumanEval/129", "solution": "def minPath(grid, k):\n \"\"\"\n Given a grid with N rows and N columns (N >= 2) and a positive integer k, \n each cell of the grid contains a value. Every integer in the range [1, N * N]\n inclusive appears exactly once on the cells of the grid.\n\n You have to find the minimum path of length k in the grid. You can start\n from any cell, and in each step you can move to any of the neighbor cells,\n in other words, you can go to cells which share an edge with you current\n cell.\n Please note that a path of length k means visiting exactly k cells (not\n necessarily distinct).\n You CANNOT go off the grid.\n A path A (of length k) is considered less than a path B (of length k) if\n after making the ordered lists of the values on the cells that A and B go\n through (let's call them lst_A and lst_B), lst_A is lexicographically less\n than lst_B, in other words, there exist an integer index i (1 <= i <= k)\n such that lst_A[i] < lst_B[i] and for any j (1 <= j < i) we have\n lst_A[j] = lst_B[j].\n It is guaranteed that the answer is unique.\n Return an ordered list of the values on the cells that the minimum path go through.\n\n Examples:\n\n Input: grid = [ [1,2,3], [4,5,6], [7,8,9]], k = 3\n Output: [1, 2, 1]\n\n Input: grid = [ [5,9,3], [4,1,6], [7,8,2]], k = 1\n Output: [1]\n \"\"\"\n n = len(grid)\n \n # Find the cell with the minimum value (which is 1)\n # Since we want lexicographically smallest path, we should start from the cell with value 1\n # because any path starting with 1 will be lexicographically smaller than any path starting with a larger value.\n \n # Find position of 1\n start_pos = None\n for i in range(n):\n for j in range(n):\n if grid[i][j] == 1:\n start_pos = (i, j)\n break\n if start_pos:\n break\n \n # Now we need to find the lexicographically smallest path of length k starting from the cell with value 1.\n # We can use BFS/DFS with pruning, but since k can be large, we need a smarter approach.\n # \n # The key insight: at each step, we want to choose the neighbor with the smallest value.\n # However, this greedy approach might not always work because we need to consider future steps.\n # \n # Actually, for lexicographic minimization, a greedy approach works: at each step, among all possible \n # next cells (neighbors of current cell), pick the one with the smallest value. If there are ties,\n # we need to look ahead. But since the problem guarantees a unique answer, we can use a more careful approach.\n #\n # Let's think again: we start at the cell with value 1. At each subsequent step, we want to pick the \n # neighbor with the smallest value. If there are multiple neighbors with the same smallest value, we need \n # to determine which one leads to the lexicographically smallest overall path.\n #\n # A proper approach: use dynamic programming or iterative deepening. But for efficiency, let's use a \n # greedy approach with tie-breaking by looking at future possibilities.\n #\n # Actually, the simplest correct approach for small k is to enumerate all paths of length k starting from \n # the minimum cell and pick the lexicographically smallest. But this could be exponential.\n #\n # Better approach: at each step, among all neighbors, pick the one with the smallest value. If there are \n # ties, we need to break them. We can do this by recursively checking which tie leads to the smallest \n # subsequent path.\n \n # Let's implement a recursive solution with memoization or iterative approach.\n \n # For efficiency, let's use a greedy approach: at each step, pick the neighbor with the smallest value.\n # If there are ties, we need to look ahead one more step to break ties.\n \n def get_neighbors(pos):\n i, j = pos\n neighbors = []\n for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\n ni, nj = i + di, j + dj\n if 0 <= ni < n and 0 <= nj < n:\n neighbors.append((ni, nj))\n return neighbors\n \n # Start from the cell with value 1\n current_pos = start_pos\n path = [grid[current_pos[0]][current_pos[1]]]\n \n for step in range(1, k):\n neighbors = get_neighbors(current_pos)\n if not neighbors:\n # No neighbors, stay in place (but this shouldn't happen for N >= 2)\n path.append(grid[current_pos[0]][current_pos[1]])\n continue\n \n # Find the minimum value among neighbors\n min_val = min(grid[ni][nj] for ni, nj in neighbors)\n \n # Get all neighbors with the minimum value\n best_neighbors = [(ni, nj) for ni, nj in neighbors if grid[ni][nj] == min_val]\n \n if len(best_neighbors) == 1:\n current_pos = best_neighbors[0]\n else:\n # Tie-breaking: look at the next step for each candidate\n # For each candidate, find the minimum value reachable in the next step\n # Pick the candidate whose next step minimum is smallest\n def get_next_min(pos):\n next_neighbors = get_neighbors(pos)\n if not next_neighbors:\n return float('inf')\n return min(grid[ni][nj] for ni, nj in next_neighbors)\n \n # For tie-breaking, we look at the minimum value reachable from each candidate in the next step\n # If still tied, we might need to look further, but let's try this first\n best_next_min = float('inf')\n chosen = None\n for ni, nj in best_neighbors:\n next_min = get_next_min((ni, nj))\n if next_min < best_next_min:\n best_next_min = next_min\n chosen = (ni, nj)\n elif next_min == best_next_min:\n # Further tie-breaking: look at the step after that\n # This could get complex, but let's try a more robust approach\n pass\n \n if chosen:\n current_pos = chosen\n else:\n # Fallback: pick the first one\n current_pos = best_neighbors[0]\n \n path.append(grid[current_pos[0]][current_pos[1]])\n \n return path", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/132": [{"task_id": "HumanEval/132", "solution": "def is_nested(string):\n '''\n Create a function that takes a string as input which contains only square brackets.\n The function should return True if and only if there is a valid subsequence of brackets \n where at least one bracket in the subsequence is nested.\n\n is_nested('[[]]') \u279e True\n is_nested('[]]]]]]][[[[[]') \u279e False\n is_nested('[][]') \u279e False\n is_nested('[]') \u279e False\n is_nested('[[][]]') \u279e True\n is_nested('[[]][[') \u279e True\n '''\n # We need to find if there exists a valid subsequence of brackets that has at least one nesting.\n # A valid bracket sequence is one where brackets are properly matched.\n # \"Nested\" means there is at least one pair of brackets inside another pair.\n # For example, '[[]]' has nesting because the inner [] is inside the outer [].\n # '[][]' does not have nesting because the two pairs are adjacent, not nested.\n \n # Approach: We can use a stack-based approach to find the maximum nesting depth.\n # If the maximum nesting depth is at least 2, then there is at least one nested bracket.\n # But we also need the subsequence to be valid.\n \n # Actually, let's think more carefully. We need a valid subsequence (not necessarily contiguous) \n # that has at least one nesting. \n \n # A valid bracket sequence with nesting means there exist indices i < j < k < l such that\n # string[i] = '[', string[j] = '[', string[k] = ']', string[l] = ']' and this forms a valid \n # nested structure. But since it's a subsequence, we just need to find if there's a way to pick \n # brackets that form a valid sequence with depth >= 2.\n \n # Key insight: If we can find two opening brackets and two closing brackets in the right order \n # such that the first opening bracket comes before the second opening bracket, which comes before \n # the first closing bracket, which comes before the second closing bracket, then we have a nested \n # valid subsequence \"[[]]\".\n \n # So we need to find indices i < j < k < l where string[i] = '[', string[j] = '[', string[k] = ']', string[l] = ']'\n \n # Let's find the first two '[' and the last two ']' and check if they are in the right order.\n \n # Find all positions of '[' and ']'\n open_positions = [i for i, c in enumerate(string) if c == '[']\n close_positions = [i for i, c in enumerate(string) if c == ']']\n \n # We need at least 2 opening brackets and 2 closing brackets\n if len(open_positions) < 2 or len(close_positions) < 2:\n return False\n \n # We need to find i < j < k < l where i, j are open positions and k, l are close positions\n # Take the first two open positions and the last two close positions\n first_open = open_positions[0]\n second_open = open_positions[1]\n second_last_close = close_positions[-2]\n last_close = close_positions[-1]\n \n # Check if first_open < second_open < second_last_close < last_close\n if first_open < second_open < second_last_close < last_close:\n return True\n \n # But wait, this might not cover all cases. Let me think again.\n # Actually, we need ANY valid subsequence with nesting. The simplest nested valid sequence is \"[[]]\".\n # So we just need to find 4 indices i < j < k < l with string[i]='[', string[j]='[', string[k]=']', string[l]=']'\n \n # Let's try a different approach: find the earliest pair of '[' and the latest pair of ']'\n # such that the second '[' comes before the first ']' of the closing pair.\n \n # Take the first two '[' positions\n if len(open_positions) >= 2:\n # Take the last two ']' positions\n if len(close_positions) >= 2:\n # Check if open_positions[1] < close_positions[-2]\n if open_positions[1] < close_positions[-2]:\n return True\n \n return False", "base_status": "pass", "plus_status": "fail", "base_fail_tests": [], "plus_fail_tests": [["[][][]"]]}], "HumanEval/131": [{"task_id": "HumanEval/131", "solution": "def digits(n):\n \"\"\"Given a positive integer n, return the product of the odd digits.\n Return 0 if all digits are even.\n For example:\n digits(1) == 1\n digits(4) == 0\n digits(235) == 15\n \"\"\"\n product = 1\n found_odd = False\n for digit_char in str(n):\n digit = int(digit_char)\n if digit % 2 != 0:\n product *= digit\n found_odd = True\n if not found_odd:\n return 0\n return product", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/133": [{"task_id": "HumanEval/133", "solution": "import math\ndef sum_squares(lst):\n \"\"\"You are given a list of numbers.\n You need to return the sum of squared numbers in the given list,\n round each element in the list to the upper int(Ceiling) first.\n Examples:\n For lst = [1,2,3] the output should be 14\n For lst = [1,4,9] the output should be 98\n For lst = [1,3,5,7] the output should be 84\n For lst = [1.4,4.2,0] the output should be 29\n For lst = [-2.4,1,1] the output should be 6\n \n\n \"\"\"\n total = 0\n for num in lst:\n ceiling_val = math.ceil(num)\n total += ceiling_val ** 2\n return total", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/134": [{"task_id": "HumanEval/134", "solution": "def check_if_last_char_is_a_letter(txt):\n '''\n Create a function that returns True if the last character\n of a given string is an alphabetical character and is not\n a part of a word, and False otherwise.\n Note: \"word\" is a group of characters separated by space.\n\n Examples:\n check_if_last_char_is_a_letter(\"apple pie\") \u279e False\n check_if_last_char_is_a_letter(\"apple pi e\") \u279e True\n check_if_last_char_is_a_letter(\"apple pi e \") \u279e False\n check_if_last_char_is_a_letter(\"\") \u279e False \n '''\n if not txt:\n return False\n \n # Strip trailing whitespace to get the actual last character\n stripped = txt.rstrip()\n \n if not stripped:\n return False\n \n last_char = stripped[-1]\n \n # Check if the last character is an alphabetical character\n if not last_char.isalpha():\n return False\n \n # Check if it is not part of a word.\n # A word is a group of characters separated by space.\n # If the last character is part of a word, it means it's connected to other characters in the same word.\n # Since we stripped trailing spaces, the last character is the end of the last word.\n # For it to NOT be part of a word, it should be a standalone single-character word.\n # That means the last word (after stripping) should be exactly that single character.\n \n # Split the stripped string by spaces to get words\n words = stripped.split()\n \n if not words:\n return False\n \n last_word = words[-1]\n \n # The last character is not part of a word if the last word is exactly that single character\n # i.e., the last word has length 1\n if len(last_word) == 1:\n return True\n else:\n return False", "base_status": "fail", "plus_status": "fail", "base_fail_tests": [["eeeee e "]], "plus_fail_tests": [["apple pi\ne"]]}], "HumanEval/135": [{"task_id": "HumanEval/135", "solution": "def can_arrange(arr):\n \"\"\"Create a function which returns the largest index of an element which\n is not greater than or equal to the element immediately preceding it. If\n no such element exists then return -1. The given array will not contain\n duplicate values.\n\n Examples:\n can_arrange([1,2,4,3,5]) = 3\n can_arrange([1,2,3]) = -1\n \"\"\"\n largest_index = -1\n for i in range(1, len(arr)):\n if arr[i] < arr[i - 1]:\n largest_index = i\n return largest_index", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/136": [{"task_id": "HumanEval/136", "solution": "def largest_smallest_integers(lst):\n '''\n Create a function that returns a tuple (a, b), where 'a' is\n the largest of negative integers, and 'b' is the smallest\n of positive integers in a list.\n If there is no negative or positive integers, return them as None.\n\n Examples:\n largest_smallest_integers([2, 4, 1, 3, 5, 7]) == (None, 1)\n largest_smallest_integers([]) == (None, None)\n largest_smallest_integers([0]) == (None, None)\n '''\n negatives = [x for x in lst if x < 0]\n positives = [x for x in lst if x > 0]\n \n a = max(negatives) if negatives else None\n b = min(positives) if positives else None\n \n return (a, b)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/137": [{"task_id": "HumanEval/137", "solution": "def compare_one(a, b):\n \"\"\"\n Create a function that takes integers, floats, or strings representing\n real numbers, and returns the larger variable in its given variable type.\n Return None if the values are equal.\n Note: If a real number is represented as a string, the floating point might be . or ,\n\n compare_one(1, 2.5) \u279e 2.5\n compare_one(1, \"2,3\") \u279e \"2,3\"\n compare_one(\"5,1\", \"6\") \u279e \"6\"\n compare_one(\"1\", 1) \u279e None\n \"\"\"\n \n def parse_value(val):\n \"\"\"Convert a value to its numeric float representation.\"\"\"\n if isinstance(val, str):\n # Replace comma with dot for decimal parsing\n val = val.replace(',', '.')\n return float(val)\n else:\n return float(val)\n \n # Parse both values to floats for comparison\n a_num = parse_value(a)\n b_num = parse_value(b)\n \n if a_num > b_num:\n return a\n elif b_num > a_num:\n return b\n else:\n return None", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/138": [{"task_id": "HumanEval/138", "solution": "def is_equal_to_sum_even(n):\n \"\"\"Evaluate whether the given number n can be written as the sum of exactly 4 positive even numbers\n Example\n is_equal_to_sum_even(4) == False\n is_equal_to_sum_even(6) == False\n is_equal_to_sum_even(8) == True\n \"\"\"\n # The smallest positive even number is 2.\n # The sum of 4 positive even numbers must be at least 2+2+2+2 = 8.\n # Also, the sum of 4 even numbers is always even.\n # So n must be even and n >= 8.\n if n < 8:\n return False\n if n % 2 != 0:\n return False\n return True", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/140": [{"task_id": "HumanEval/140", "solution": "def fix_spaces(text):\n \"\"\"\n Given a string text, replace all spaces in it with underscores, \n and if a string has more than 2 consecutive spaces, \n then replace all consecutive spaces with - \n \n fix_spaces(\"Example\") == \"Example\"\n fix_spaces(\"Example 1\") == \"Example_1\"\n fix_spaces(\" Example 2\") == \"_Example_2\"\n fix_spaces(\" Example 3\") == \"_Example-3\"\n \"\"\"\n # We need to handle consecutive spaces:\n # - If there are more than 2 consecutive spaces, replace the entire sequence with a single '-'\n # - Otherwise, replace each space with '_'\n \n # Strategy: Split the text into tokens separated by spaces, but we need to track the number of spaces.\n # A better approach: use regex to find sequences of spaces.\n # - If a sequence of spaces has length > 2, replace with '-'\n # - If a sequence of spaces has length 1 or 2, replace each space with '_'\n \n import re\n \n def replace_spaces(match):\n spaces = match.group(0)\n if len(spaces) > 2:\n return '-'\n else:\n return '_' * len(spaces)\n \n result = re.sub(r' +', replace_spaces, text)\n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/141": [{"task_id": "HumanEval/141", "solution": "def file_name_check(file_name):\n \"\"\"Create a function which takes a string representing a file's name, and returns\n 'Yes' if the the file's name is valid, and returns 'No' otherwise.\n A file's name is considered to be valid if and only if all the following conditions \n are met:\n - There should not be more than three digits ('0'-'9') in the file's name.\n - The file's name contains exactly one dot '.'\n - The substring before the dot should not be empty, and it starts with a letter from \n the latin alphapet ('a'-'z' and 'A'-'Z').\n - The substring after the dot should be one of these: ['txt', 'exe', 'dll']\n Examples:\n file_name_check(\"example.txt\") # => 'Yes'\n file_name_check(\"1example.dll\") # => 'No' (the name should start with a latin alphapet letter)\n \"\"\"\n # Check if there is exactly one dot\n if file_name.count('.') != 1:\n return 'No'\n \n # Split into name and extension\n parts = file_name.split('.')\n name_part = parts[0]\n ext_part = parts[1]\n \n # Check if the name part is not empty\n if not name_part:\n return 'No'\n \n # Check if the name part starts with a latin alphabet letter\n if not name_part[0].isalpha():\n return 'No'\n \n # Check if the extension is one of the allowed ones\n if ext_part not in ['txt', 'exe', 'dll']:\n return 'No'\n \n # Check if there are no more than three digits in the entire file name\n digit_count = sum(1 for c in file_name if c.isdigit())\n if digit_count > 3:\n return 'No'\n \n return 'Yes'", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/142": [{"task_id": "HumanEval/142", "solution": "def sum_squares(lst):\n \"\"\"\"\n 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 \n 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 \n change the entries in the list whose indexes are not a multiple of 3 or 4. The function shall then return the sum of all entries. \n \n Examples:\n For lst = [1,2,3] the output should be 6\n For lst = [] the output should be 0\n For lst = [-1,-5,2,-1,-5] the output should be -126\n \"\"\"\n total = 0\n for i, val in enumerate(lst):\n if i % 3 == 0:\n total += val ** 2\n elif i % 4 == 0:\n total += val ** 3\n else:\n total += val\n return total", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/143": [{"task_id": "HumanEval/143", "solution": "def words_in_sentence(sentence):\n \"\"\"\n You are given a string representing a sentence,\n the sentence contains some words separated by a space,\n and you have to return a string that contains the words from the original sentence,\n whose lengths are prime numbers,\n the order of the words in the new string should be the same as the original one.\n\n Example 1:\n Input: sentence = \"This is a test\"\n Output: \"is\"\n\n Example 2:\n Input: sentence = \"lets go for swimming\"\n Output: \"go for\"\n\n Constraints:\n * 1 <= len(sentence) <= 100\n * sentence contains only letters\n \"\"\"\n \n def is_prime(n):\n if n < 2:\n return False\n if n == 2:\n return True\n if n % 2 == 0:\n return False\n for i in range(3, int(n**0.5) + 1, 2):\n if n % i == 0:\n return False\n return True\n \n words = sentence.split()\n result_words = [word for word in words if is_prime(len(word))]\n return \" \".join(result_words)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/130": [{"task_id": "HumanEval/130", "solution": "def tri(n):\n \"\"\"Everyone knows Fibonacci sequence, it was studied deeply by mathematicians in \n the last couple centuries. However, what people don't know is Tribonacci sequence.\n Tribonacci sequence is defined by the recurrence:\n tri(1) = 3\n tri(n) = 1 + n / 2, if n is even.\n tri(n) = tri(n - 1) + tri(n - 2) + tri(n + 1), if n is odd.\n For example:\n tri(2) = 1 + (2 / 2) = 2\n tri(4) = 3\n tri(3) = tri(2) + tri(1) + tri(4)\n = 2 + 3 + 3 = 8 \n You are given a non-negative integer number n, you have to a return a list of the \n first n + 1 numbers of the Tribonacci sequence.\n Examples:\n tri(3) = [1, 3, 2, 8]\n \"\"\"\n if n < 0:\n return []\n \n # We need to compute tri(0), tri(1), ..., tri(n)\n # From the examples: tri(3) = [1, 3, 2, 8]\n # So tri(0) = 1, tri(1) = 3, tri(2) = 2, tri(3) = 8\n \n # Let's figure out the base cases:\n # tri(0): The example shows tri(3) returns [1, 3, 2, 8], so index 0 is 1.\n # tri(1) = 3 (given)\n # For even n: tri(n) = 1 + n/2\n # tri(0): 0 is even, so tri(0) = 1 + 0/2 = 1. This matches!\n # tri(2): 2 is even, so tri(2) = 1 + 2/2 = 2. This matches!\n # tri(4): 4 is even, so tri(4) = 1 + 4/2 = 3. This matches!\n # For odd n > 1: tri(n) = tri(n-1) + tri(n-2) + tri(n+1)\n # But this references tri(n+1), which is a future value. This is tricky.\n # Let's think about it differently. For odd n, we have:\n # tri(n) = tri(n-1) + tri(n-2) + tri(n+1)\n # This means tri(n+1) = tri(n) - tri(n-1) - tri(n-2)\n # So if we know tri(n-1) and tri(n-2), and we can compute tri(n+1) for even n+1,\n # we can solve for tri(n).\n \n # Let's build the sequence iteratively.\n # We know:\n # - For even k: tri(k) = 1 + k/2\n # - For odd k: tri(k) = tri(k-1) + tri(k-2) + tri(k+1)\n \n # Since odd terms depend on the next term (which is even), we can compute even terms first,\n # then use them to compute odd terms.\n \n # Let's compute all values from 0 to n.\n result = [0] * (n + 1)\n \n # First, compute all even indices\n for k in range(0, n + 1):\n if k % 2 == 0:\n result[k] = 1 + k / 2\n \n # Now compute odd indices. For odd k, tri(k) = tri(k-1) + tri(k-2) + tri(k+1)\n # But tri(k+1) might be beyond n if k = n and n is odd.\n # If k = n and n is odd, we need tri(n+1). Let's compute it if needed.\n \n for k in range(1, n + 1):\n if k % 2 == 1:\n # tri(k) = tri(k-1) + tri(k-2) + tri(k+1)\n # k-1 is even, k-2 is odd (if k >= 3) or k-2 = -1 if k=1\n # Wait, for k=1: tri(1) = 3 is given directly.\n if k == 1:\n result[k] = 3\n else:\n # k >= 3, odd\n # tri(k-1) is even index, already computed\n # tri(k-2) is odd index, should be already computed if we go in order\n # tri(k+1) is even index, already computed if k+1 <= n\n # If k+1 > n, we need to compute tri(k+1) = 1 + (k+1)/2 since k+1 is even\n if k + 1 <= n:\n tri_k_plus_1 = result[k + 1]\n else:\n tri_k_plus_1 = 1 + (k + 1) / 2\n result[k] = result[k - 1] + result[k - 2] + tri_k_plus_1\n \n # Convert to integers if they are whole numbers\n final_result = []\n for val in result:\n if val == int(val):\n final_result.append(int(val))\n else:\n final_result.append(val)\n \n return final_result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/144": [{"task_id": "HumanEval/144", "solution": "def simplify(x, n):\n \"\"\"Your task is to implement a function that will simplify the expression\n x * n. The function returns True if x * n evaluates to a whole number and False\n otherwise. Both x and n, are string representation of a fraction, and have the following format,\n / where both numerator and denominator are positive whole numbers.\n\n You can assume that x, and n are valid fractions, and do not have zero as denominator.\n\n simplify(\"1/5\", \"5/1\") = True\n simplify(\"1/6\", \"2/1\") = False\n simplify(\"7/10\", \"10/2\") = False\n \"\"\"\n # Parse the fractions\n x_num, x_den = map(int, x.split('/'))\n n_num, n_den = map(int, n.split('/'))\n \n # Multiply the fractions: (x_num * n_num) / (x_den * n_den)\n numerator = x_num * n_num\n denominator = x_den * n_den\n \n # Check if the result is a whole number\n # A fraction is a whole number if numerator is divisible by denominator\n if denominator == 0:\n return False\n return numerator % denominator == 0", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/145": [{"task_id": "HumanEval/145", "solution": "def order_by_points(nums):\n \"\"\"\n Write a function which sorts the given list of integers\n in ascending order according to the sum of their digits.\n Note: if there are several items with similar sum of their digits,\n order them based on their index in original list.\n\n For example:\n >>> order_by_points([1, 11, -1, -11, -12]) == [-1, -11, 1, -12, 11]\n >>> order_by_points([]) == []\n \"\"\"\n def digit_sum(n):\n # Handle negative numbers: sum of digits of absolute value, but we need to consider the sign\n # Looking at the example: -1 has digit sum 1, -11 has digit sum 2, -12 has digit sum 3\n # 1 has digit sum 1, 11 has digit sum 2\n # So it seems like we take the absolute value and sum the digits\n n = abs(n)\n total = 0\n while n > 0:\n total += n % 10\n n //= 10\n return total\n \n # Create a list of (digit_sum, original_index, value) tuples\n indexed_nums = [(digit_sum(num), i, num) for i, num in enumerate(nums)]\n \n # Sort by digit_sum first, then by original index (stable sort preserves order for equal keys)\n indexed_nums.sort(key=lambda x: (x[0], x[1]))\n \n # Extract the values in sorted order\n return [num for _, _, num in indexed_nums]", "base_status": "fail", "plus_status": "fail", "base_fail_tests": [[[1, 11, -1, -11, -12]]], "plus_fail_tests": [[[-5, -12, 9, 15]]]}], "HumanEval/146": [{"task_id": "HumanEval/146", "solution": "def specialFilter(nums):\n \"\"\"Write a function that takes an array of numbers as input and returns \n the number of elements in the array that are greater than 10 and both \n first and last digits of a number are odd (1, 3, 5, 7, 9).\n For example:\n specialFilter([15, -73, 14, -15]) => 1 \n specialFilter([33, -2, -3, 45, 21, 109]) => 2\n \"\"\"\n count = 0\n for num in nums:\n if num <= 10:\n continue\n # Get the absolute value to handle negative numbers\n abs_num = abs(num)\n # Get the last digit\n last_digit = abs_num % 10\n # Get the first digit\n first_digit = abs_num\n while first_digit >= 10:\n first_digit //= 10\n # Check if both first and last digits are odd\n if first_digit % 2 == 1 and last_digit % 2 == 1:\n count += 1\n return count", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/147": [{"task_id": "HumanEval/147", "solution": "def get_max_triples(n):\n \"\"\"\n You are given a positive integer n. You have to create an integer array a of length n.\n For each i (1 \u2264 i \u2264 n), the value of a[i] = i * i - i + 1.\n Return the number of triples (a[i], a[j], a[k]) of a where i < j < k, \n and a[i] + a[j] + a[k] is a multiple of 3.\n\n Example :\n Input: n = 5\n Output: 1\n Explanation: \n a = [1, 3, 7, 13, 21]\n The only valid triple is (1, 7, 13).\n \"\"\"\n if n < 3:\n return 0\n \n # Compute the array a\n a = [i * i - i + 1 for i in range(1, n + 1)]\n \n # We need to count triples (i, j, k) with i < j < k such that a[i] + a[j] + a[k] is divisible by 3.\n # Instead of checking all triples (O(n^3)), we can use the fact that we only care about values mod 3.\n # Let's compute each a[i] mod 3.\n \n mods = [x % 3 for x in a]\n \n # Count how many elements have remainder 0, 1, 2 mod 3\n count = [0, 0, 0]\n for m in mods:\n count[m] += 1\n \n # A triple sums to 0 mod 3 if:\n # - All three are 0 mod 3: C(count[0], 3)\n # - All three are 1 mod 3: C(count[1], 3)\n # - All three are 2 mod 3: C(count[2], 3)\n # - One of each: count[0] * count[1] * count[2]\n \n def comb3(x):\n if x < 3:\n return 0\n return x * (x - 1) * (x - 2) // 6\n \n result = comb3(count[0]) + comb3(count[1]) + comb3(count[2]) + count[0] * count[1] * count[2]\n \n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/148": [{"task_id": "HumanEval/148", "solution": "def bf(planet1, planet2):\n '''\n There are eight planets in our solar system: the closerst to the Sun \n is Mercury, the next one is Venus, then Earth, Mars, Jupiter, Saturn, \n Uranus, Neptune.\n Write a function that takes two planet names as strings planet1 and planet2. \n The function should return a tuple containing all planets whose orbits are \n located between the orbit of planet1 and the orbit of planet2, sorted by \n the proximity to the sun. \n The function should return an empty tuple if planet1 or planet2\n are not correct planet names. \n Examples\n bf(\"Jupiter\", \"Neptune\") ==> (\"Saturn\", \"Uranus\")\n bf(\"Earth\", \"Mercury\") ==> (\"Venus\")\n bf(\"Mercury\", \"Uranus\") ==> (\"Venus\", \"Earth\", \"Mars\", \"Jupiter\", \"Saturn\")\n '''\n planets = [\"Mercury\", \"Venus\", \"Earth\", \"Mars\", \"Jupiter\", \"Saturn\", \"Uranus\", \"Neptune\"]\n \n if planet1 not in planets or planet2 not in planets:\n return ()\n \n idx1 = planets.index(planet1)\n idx2 = planets.index(planet2)\n \n # Determine the lower and higher indices\n lower = min(idx1, idx2)\n higher = max(idx1, idx2)\n \n # Get planets between them (exclusive)\n between = planets[lower+1:higher]\n \n return tuple(between)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/149": [{"task_id": "HumanEval/149", "solution": "def sorted_list_sum(lst):\n \"\"\"Write a function that accepts a list of strings as a parameter,\n deletes the strings that have odd lengths from it,\n and returns the resulted list with a sorted order,\n The list is always a list of strings and never an array of numbers,\n and it may contain duplicates.\n The order of the list should be ascending by length of each word, and you\n should return the list sorted by that rule.\n If two words have the same length, sort the list alphabetically.\n The function should return a list of strings in sorted order.\n You may assume that all words will have the same length.\n For example:\n assert list_sort([\"aa\", \"a\", \"aaa\"]) => [\"aa\"]\n assert list_sort([\"ab\", \"a\", \"aaa\", \"cd\"]) => [\"ab\", \"cd\"]\n \"\"\"\n # Filter out strings with odd lengths\n filtered = [s for s in lst if len(s) % 2 == 0]\n \n # Sort by length first, then alphabetically\n sorted_filtered = sorted(filtered, key=lambda s: (len(s), s))\n \n return sorted_filtered", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/150": [{"task_id": "HumanEval/150", "solution": "def x_or_y(n, x, y):\n \"\"\"A simple program which should return the value of x if n is \n a prime number and should return the value of y otherwise.\n\n Examples:\n for x_or_y(7, 34, 12) == 34\n for x_or_y(15, 8, 5) == 5\n \n \"\"\"\n def is_prime(num):\n if num < 2:\n return False\n if num == 2:\n return True\n if num % 2 == 0:\n return False\n for i in range(3, int(num**0.5) + 1, 2):\n if num % i == 0:\n return False\n return True\n \n if is_prime(n):\n return x\n else:\n return y", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/151": [{"task_id": "HumanEval/151", "solution": "def double_the_difference(lst):\n '''\n Given a list of numbers, return the sum of squares of the numbers\n in the list that are odd. Ignore numbers that are negative or not integers.\n \n double_the_difference([1, 3, 2, 0]) == 1 + 9 + 0 + 0 = 10\n double_the_difference([-1, -2, 0]) == 0\n double_the_difference([9, -2]) == 81\n double_the_difference([0]) == 0 \n \n If the input list is empty, return 0.\n '''\n if not lst:\n return 0\n \n total = 0\n for num in lst:\n # Check if the number is an integer (not float, not negative)\n # We need to check if it's an integer type or a float that represents an integer\n # But the problem says \"ignore numbers that are negative or not integers\"\n # So we need to check:\n # 1. Is it an integer? (i.e., isinstance(num, int) or if it's a float, check if it's a whole number)\n # 2. Is it non-negative?\n # 3. Is it odd?\n \n # First, check if it's an integer. We consider both int and float that are whole numbers.\n if isinstance(num, bool):\n # bool is a subclass of int in Python, so we need to exclude it\n continue\n if isinstance(num, int):\n # It's an integer\n if num < 0:\n continue\n if num % 2 != 0:\n total += num * num\n elif isinstance(num, float):\n # Check if it's a whole number\n if num != int(num):\n continue\n # It's a whole number represented as float\n int_num = int(num)\n if int_num < 0:\n continue\n if int_num % 2 != 0:\n total += int_num * int_num\n else:\n # Not an integer or float, ignore\n continue\n \n return total", "base_status": "pass", "plus_status": "fail", "base_fail_tests": [], "plus_fail_tests": [[[1.0, 3.5, -4.6]]]}], "HumanEval/152": [{"task_id": "HumanEval/152", "solution": "def compare(game, guess):\n \"\"\"I think we all remember that feeling when the result of some long-awaited\n event is finally known. The feelings and thoughts you have at that moment are\n definitely worth noting down and comparing.\n Your task is to determine if a person correctly guessed the results of a number of matches.\n You are given two arrays of scores and guesses of equal length, where each index shows a match. \n Return an array of the same length denoting how far off each guess was. If they have guessed correctly,\n the value is 0, and if not, the value is the absolute difference between the guess and the score.\n \n \n example:\n\n compare([1,2,3,4,5,1],[1,2,3,4,2,-2]) -> [0,0,0,0,3,3]\n compare([0,5,0,0,0,4],[4,1,1,0,0,-2]) -> [4,4,1,0,0,6]\n \"\"\"\n return [abs(g - g_) for g, g_ in zip(game, guess)]", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/153": [{"task_id": "HumanEval/153", "solution": "def Strongest_Extension(class_name, extensions):\n \"\"\"You will be given the name of a class (a string) and a list of extensions.\n The extensions are to be used to load additional classes to the class. The\n strength of the extension is as follows: Let CAP be the number of the uppercase\n letters in the extension's name, and let SM be the number of lowercase letters \n in the extension's name, the strength is given by the fraction CAP - SM. \n You should find the strongest extension and return a string in this \n format: ClassName.StrongestExtensionName.\n If there are two or more extensions with the same strength, you should\n choose the one that comes first in the list.\n For example, if you are given \"Slices\" as the class and a list of the\n extensions: ['SErviNGSliCes', 'Cheese', 'StuFfed'] then you should\n return 'Slices.SErviNGSliCes' since 'SErviNGSliCes' is the strongest extension \n (its strength is -1).\n Example:\n for Strongest_Extension('my_class', ['AA', 'Be', 'CC']) == 'my_class.AA'\n \"\"\"\n if not extensions:\n return class_name\n \n def calculate_strength(ext):\n cap = sum(1 for c in ext if c.isupper())\n sm = sum(1 for c in ext if c.islower())\n return cap - sm\n \n # Find the strongest extension (highest strength)\n # If tie, choose the one that comes first in the list\n strongest_ext = None\n max_strength = None\n \n for ext in extensions:\n strength = calculate_strength(ext)\n if max_strength is None or strength > max_strength:\n max_strength = strength\n strongest_ext = ext\n \n return f\"{class_name}.{strongest_ext}\"", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/155": [{"task_id": "HumanEval/155", "solution": "def even_odd_count(num):\n \"\"\"Given an integer. return a tuple that has the number of even and odd digits respectively.\n\n Example:\n even_odd_count(-12) ==> (1, 1)\n even_odd_count(123) ==> (1, 2)\n \"\"\"\n # Convert the number to its absolute value and then to string to handle negative numbers\n num_str = str(abs(num))\n \n even_count = 0\n odd_count = 0\n \n for digit in num_str:\n d = int(digit)\n if d % 2 == 0:\n even_count += 1\n else:\n odd_count += 1\n \n return (even_count, odd_count)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/154": [{"task_id": "HumanEval/154", "solution": "def cycpattern_check(a, b):\n \"\"\"You are given 2 words. You need to return True if the second word or any of its rotations is a substring in the first word\n cycpattern_check(\"abcd\",\"abd\") => False\n cycpattern_check(\"hello\",\"ell\") => True\n cycpattern_check(\"whassup\",\"psus\") => False\n cycpattern_check(\"abab\",\"baa\") => True\n cycpattern_check(\"efef\",\"eeff\") => False\n cycpattern_check(\"himenss\",\"simen\") => True\n\n \"\"\"\n if not b:\n return True\n if len(b) > len(a):\n return False\n \n # Generate all rotations of b and check if any is a substring of a\n # A rotation of b can be obtained by taking b + b and looking at substrings of length len(b)\n double_b = b + b\n for i in range(len(b)):\n rotation = double_b[i:i + len(b)]\n if rotation in a:\n return True\n return False", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/139": [{"task_id": "HumanEval/139", "solution": "def special_factorial(n):\n \"\"\"The Brazilian factorial is defined as:\n brazilian_factorial(n) = n! * (n-1)! * (n-2)! * ... * 1!\n where n > 0\n\n For example:\n >>> special_factorial(4)\n 288\n\n The function will receive an integer as input and should return the special\n factorial of this integer.\n \"\"\"\n import math\n \n if n <= 0:\n raise ValueError(\"n must be greater than 0\")\n \n result = 1\n for i in range(1, n + 1):\n result *= math.factorial(i)\n \n return result", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/156": [{"task_id": "HumanEval/156", "solution": "def int_to_mini_roman(number):\n \"\"\"\n Given a positive integer, obtain its roman numeral equivalent as a string,\n and return it in lowercase.\n Restrictions: 1 <= num <= 1000\n\n Examples:\n >>> int_to_mini_roman(19) == 'xix'\n >>> int_to_mini_roman(152) == 'clii'\n >>> int_to_mini_roman(426) == 'cdxxvi'\n \"\"\"\n # Define the mapping of values to Roman numeral symbols in descending order\n val_sym_pairs = [\n (1000, 'M'),\n (900, 'CM'),\n (500, 'D'),\n (400, 'CD'),\n (100, 'C'),\n (90, 'XC'),\n (50, 'L'),\n (40, 'XL'),\n (10, 'X'),\n (9, 'IX'),\n (5, 'V'),\n (4, 'IV'),\n (1, 'I'),\n ]\n \n result = []\n for value, symbol in val_sym_pairs:\n while number >= value:\n result.append(symbol)\n number -= value\n \n return ''.join(result).lower()", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/157": [{"task_id": "HumanEval/157", "solution": "def right_angle_triangle(a, b, c):\n '''\n Given the lengths of the three sides of a triangle. Return True if the three\n sides form a right-angled triangle, False otherwise.\n A right-angled triangle is a triangle in which one angle is right angle or \n 90 degree.\n Example:\n right_angle_triangle(3, 4, 5) == True\n right_angle_triangle(1, 2, 3) == False\n '''\n # First, check if the sides can form a valid triangle\n if a <= 0 or b <= 0 or c <= 0:\n return False\n if a + b <= c or a + c <= b or b + c <= a:\n return False\n \n # Sort the sides so that c is the largest (hypotenuse candidate)\n sides = sorted([a, b, c])\n # Check Pythagorean theorem: a^2 + b^2 == c^2\n return abs(sides[0]**2 + sides[1]**2 - sides[2]**2) < 1e-9", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/158": [{"task_id": "HumanEval/158", "solution": "def find_max(words):\n \"\"\"Write a function that accepts a list of strings.\n The list contains different words. Return the word with maximum number\n of unique characters. If multiple strings have maximum number of unique\n characters, return the one which comes first in lexicographical order.\n\n find_max([\"name\", \"of\", \"string\"]) == \"string\"\n find_max([\"name\", \"enam\", \"game\"]) == \"enam\"\n find_max([\"aaaaaaa\", \"bb\" ,\"cc\"]) == \"aaaaaaa\"\n \"\"\"\n if not words:\n return \"\"\n \n def unique_char_count(word):\n return len(set(word))\n \n # Find the maximum number of unique characters\n max_unique = max(unique_char_count(word) for word in words)\n \n # Filter words that have the maximum number of unique characters\n candidates = [word for word in words if unique_char_count(word) == max_unique]\n \n # Return the lexicographically smallest one\n return min(candidates)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/159": [{"task_id": "HumanEval/159", "solution": "def eat(number, need, remaining):\n \"\"\"\n You're a hungry rabbit, and you already have eaten a certain number of carrots,\n but now you need to eat more carrots to complete the day's meals.\n you should return an array of [ total number of eaten carrots after your meals,\n the number of carrots left after your meals ]\n if there are not enough remaining carrots, you will eat all remaining carrots, but will still be hungry.\n \n Example:\n * eat(5, 6, 10) -> [11, 4]\n * eat(4, 8, 9) -> [12, 1]\n * eat(1, 10, 10) -> [11, 0]\n * eat(2, 11, 5) -> [7, 0]\n \n Variables:\n @number : integer\n the number of carrots that you have eaten.\n @need : integer\n the number of carrots that you need to eat.\n @remaining : integer\n the number of remaining carrots thet exist in stock\n \n Constrain:\n * 0 <= number <= 1000\n * 0 <= need <= 1000\n * 0 <= remaining <= 1000\n\n Have fun :)\n \"\"\"\n # Determine how many carrots the rabbit can actually eat\n if remaining >= need:\n eaten = need\n left = remaining - need\n else:\n eaten = remaining\n left = 0\n \n total_eaten = number + eaten\n return [total_eaten, left]", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/162": [{"task_id": "HumanEval/162", "solution": "import hashlib\ndef string_to_md5(text):\n \"\"\"\n Given a string 'text', return its md5 hash equivalent string.\n If 'text' is an empty string, return None.\n\n >>> string_to_md5('Hello world') == '3e25960a79dbc69b674cd4ec67a72c62'\n \"\"\"\n if text == '':\n return None\n return hashlib.md5(text.encode('utf-8')).hexdigest()", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/160": [{"task_id": "HumanEval/160", "solution": "def do_algebra(operator, operand):\n \"\"\"\n Given two lists operator, and operand. The first list has basic algebra operations, and \n the second list is a list of integers. Use the two given lists to build the algebric \n expression and return the evaluation of this expression.\n\n The basic algebra operations:\n Addition ( + ) \n Subtraction ( - ) \n Multiplication ( * ) \n Floor division ( // ) \n Exponentiation ( ** ) \n\n Example:\n operator['+', '*', '-']\n array = [2, 3, 4, 5]\n result = 2 + 3 * 4 - 5\n => result = 9\n\n Note:\n The length of operator list is equal to the length of operand list minus one.\n Operand is a list of of non-negative integers.\n Operator list has at least one operator, and operand list has at least two operands.\n\n \"\"\"\n # Build the expression string\n expr = str(operand[0])\n for i, op in enumerate(operator):\n expr += f\" {op} {operand[i+1]}\"\n \n # Evaluate the expression\n return eval(expr)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/161": [{"task_id": "HumanEval/161", "solution": "def solve(s):\n \"\"\"You are given a string s.\n if s[i] is a letter, reverse its case from lower to upper or vise versa, \n otherwise keep it as it is.\n If the string contains no letters, reverse the string.\n The function should return the resulted string.\n Examples\n solve(\"1234\") = \"4321\"\n solve(\"ab\") = \"AB\"\n solve(\"#a@C\") = \"#A@c\"\n \"\"\"\n # Check if the string contains any letters\n has_letters = any(c.isalpha() for c in s)\n \n if not has_letters:\n # Reverse the string if no letters are present\n return s[::-1]\n else:\n # Reverse the case of each letter, keep non-letters as is\n result = []\n for c in s:\n if c.isalpha():\n if c.islower():\n result.append(c.upper())\n else:\n result.append(c.lower())\n else:\n result.append(c)\n return ''.join(result)", "base_status": "pass", "plus_status": "pass", "base_fail_tests": [], "plus_fail_tests": []}], "HumanEval/163": [{"task_id": "HumanEval/163", "solution": "def generate_integers(a, b):\n \"\"\"\n Given two positive integers a and b, return the even digits between a\n and b, in ascending order.\n\n For example:\n generate_integers(2, 8) => [2, 4, 6, 8]\n generate_integers(8, 2) => [2, 4, 6, 8]\n generate_integers(10, 14) => []\n \"\"\"\n # Determine the range boundaries\n lower = min(a, b)\n upper = max(a, b)\n \n # Collect even numbers in the range [lower, upper]\n result = []\n for num in range(lower, upper + 1):\n if num % 2 == 0:\n result.append(num)\n \n # Return in ascending order (already sorted since we iterate from lower to upper)\n return result", "base_status": "fail", "plus_status": "fail", "base_fail_tests": [[2, 10]], "plus_fail_tests": [[6, 12]]}]}, "pass_at_k": {"base": {"pass@1": 0.9634146341463414}, "plus": {"pass@1": 0.9329268292682927}}}