forked from saschaschramm/chatgpt
-
Notifications
You must be signed in to change notification settings - Fork 0
/
2023-04-24-samples-gpt-3.5-turbo-0301.jsonl
164 lines (164 loc) · 83 KB
/
2023-04-24-samples-gpt-3.5-turbo-0301.jsonl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
{"task_id": "HumanEval/0", "completion": "from typing import List\n\n\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 \"\"\"\n for i in range(len(numbers)):\n for j in range(i+1, len(numbers)):\n if abs(numbers[i] - numbers[j]) < threshold:\n return True\n return False\n\nassert has_close_elements([1.0, 2.0, 3.0], 0.5) == False\nassert has_close_elements([1.0, 2.8, 3.0, 4.0, 5.0, 2.0], 0.3) == True"}
{"task_id": "HumanEval/1", "completion": "from typing import List\n\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 result = []\n stack = []\n for char in paren_string:\n if char == '(':\n stack.append(char)\n elif char == ')':\n stack.pop()\n if not stack:\n result.append(''.join(stack))\n return result"}
{"task_id": "HumanEval/2", "completion": "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 return number - int(number)"}
{"task_id": "HumanEval/3", "completion": "from typing import List\n\n\ndef below_zero(operations: List[int]) -> bool:\n balance = 0\n for operation in operations:\n balance += operation\n if balance < 0:\n return True\n return False\n\nassert below_zero([1, 2, 3]) == False\nassert below_zero([1, 2, -4, 5]) == True"}
{"task_id": "HumanEval/4", "completion": "from typing import List\n\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 \"\"\"\n mean = sum(numbers) / len(numbers)\n deviations = [abs(num - mean) for num in numbers]\n return sum(deviations) / len(deviations)\n\nprint(mean_absolute_deviation([1.0, 2.0, 3.0, 4.0])) # 1.0"}
{"task_id": "HumanEval/5", "completion": "from typing import List\n\n\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 result = []\n for i in range(len(numbers)):\n result.append(numbers[i])\n if i != len(numbers) - 1:\n result.append(delimeter)\n return result"}
{"task_id": "HumanEval/6", "completion": "from typing import List\n\n\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 result = []\n for group in paren_string.split():\n max_depth = 0\n depth = 0\n for char in group:\n if char == '(':\n depth += 1\n max_depth = max(max_depth, depth)\n elif char == ')':\n depth -= 1\n result.append(max_depth)\n return result"}
{"task_id": "HumanEval/7", "completion": "from typing import List\n\n\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 [string for string in strings if substring in string]"}
{"task_id": "HumanEval/8", "completion": "from typing import List, Tuple\n\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 else:\n product = 1\n for num in numbers:\n product *= num\n return (sum(numbers), product)"}
{"task_id": "HumanEval/9", "completion": "from typing import List, Tuple\n\n\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 max_list = []\n current_max = float('-inf')\n for num in numbers:\n if num > current_max:\n current_max = num\n max_list.append(current_max)\n return max_list"}
{"task_id": "HumanEval/10", "completion": "def is_palindrome(string: str) -> bool:\n \"\"\" Test if given string is a palindrome \"\"\"\n return string == string[::-1]\n\n\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 \"\"\"\n if is_palindrome(string):\n return string\n for i in range(len(string)):\n if is_palindrome(string[i:]):\n return string + string[:i][::-1]\n return string + string[:-1][::-1]"}
{"task_id": "HumanEval/11", "completion": "def 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 i in range(len(a)):\n if a[i] == b[i]:\n result += '0'\n else:\n result += '1'\n return result"}
{"task_id": "HumanEval/12", "completion": "from typing import List, Optional\n\n\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 longest_string = strings[0]\n for string in strings:\n if len(string) > len(longest_string):\n longest_string = string\n return longest_string"}
{"task_id": "HumanEval/13", "completion": "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 while b:\n a, b = b, a % b\n return a"}
{"task_id": "HumanEval/14", "completion": "from typing import List\n\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(len(string)):\n prefixes.append(string[:i+1])\n return prefixes"}
{"task_id": "HumanEval/15", "completion": "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))"}
{"task_id": "HumanEval/16", "completion": "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 string = string.lower()\n distinct_chars = set(string)\n return len(distinct_chars)"}
{"task_id": "HumanEval/17", "completion": "from typing import List\n\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 notes = music_string.split()\n durations = []\n for note in notes:\n if note == 'o':\n durations.append(4)\n elif note == 'o|':\n durations.append(2)\n elif note == '.|':\n durations.append(1)\n return durations"}
{"task_id": "HumanEval/18", "completion": "def how_many_times(string: str, substring: str) -> int:\n count = 0\n if len(substring) == 0:\n return 0\n for i in range(len(string)-len(substring)+1):\n if string[i:i+len(substring)] == substring:\n count += 1\n return count"}
{"task_id": "HumanEval/19", "completion": "def sort_numbers(numbers: str) -> str:\n num_dict = {'zero': 0, 'one': 1, 'two': 2, 'three': 3, 'four': 4, 'five': 5, 'six': 6, 'seven': 7, 'eight': 8, 'nine': 9}\n num_list = numbers.split()\n num_list.sort(key=lambda x: num_dict[x])\n return ' '.join(num_list)"}
{"task_id": "HumanEval/20", "completion": "from typing import List, Tuple\n\n\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 numbers.sort()\n min_diff = float('inf')\n closest_pair = None\n for i in range(len(numbers) - 1):\n diff = numbers[i+1] - numbers[i]\n if diff < min_diff:\n min_diff = diff\n closest_pair = (numbers[i], numbers[i+1])\n return closest_pair"}
{"task_id": "HumanEval/21", "completion": "from typing import List\n\n\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_num = min(numbers)\n max_num = max(numbers)\n range_num = max_num - min_num\n return [(num - min_num) / range_num for num in numbers]"}
{"task_id": "HumanEval/22", "completion": "from typing import List, Any\n\n\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 [value for value in values if isinstance(value, int)]"}
{"task_id": "HumanEval/23", "completion": "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)"}
{"task_id": "HumanEval/24", "completion": "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 for i in range(n-1, 0, -1):\n if n % i == 0:\n return i\n return None"}
{"task_id": "HumanEval/25", "completion": "from typing import List\n\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 factors = []\n divisor = 2\n while n > 1:\n if n % divisor == 0:\n factors.append(divisor)\n n //= divisor\n else:\n divisor += 1\n return factors"}
{"task_id": "HumanEval/26", "completion": "from typing import List\n\n\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 unique_numbers = []\n for number in numbers:\n if number not in unique_numbers:\n unique_numbers.append(number)\n return unique_numbers"}
{"task_id": "HumanEval/27", "completion": "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 flipped = \"\"\n for char in string:\n if char.islower():\n flipped += char.upper()\n elif char.isupper():\n flipped += char.lower()\n else:\n flipped += char\n return flipped"}
{"task_id": "HumanEval/28", "completion": "from typing import List\n\n\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)"}
{"task_id": "HumanEval/29", "completion": "from typing import List\n\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 [string for string in strings if string.startswith(prefix)]"}
{"task_id": "HumanEval/30", "completion": "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 [num for num in l if num > 0]"}
{"task_id": "HumanEval/31", "completion": "def is_prime(n):\n \"\"\"Return true if a given number is prime, and false otherwise.\"\"\"\n if n < 2:\n return False\n for i in range(2, int(n**0.5)+1):\n if n % i == 0:\n return False\n return True\n\nprint(is_prime(6)) # False\nprint(is_prime(101)) # True\nprint(is_prime(11)) # True\nprint(is_prime(13441)) # True\nprint(is_prime(61)) # True\nprint(is_prime(4)) # False\nprint(is_prime(1)) # False"}
{"task_id": "HumanEval/32", "completion": "import math\n\n\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)])\n\n\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 if len(xs) % 2 != 0:\n raise ValueError(\"List must have even number of coefficients\")\n n = len(xs) // 2\n a = xs[-1]\n if a == 0:\n raise ValueError(\"Largest non-zero coefficient must be non-zero\")\n b = xs[n-1] + a\n c = xs[0] + b\n if c == 0:\n return 0\n p = -a / (2 * c)\n q = poly(xs, p)\n return p - q / c"}
{"task_id": "HumanEval/33", "completion": "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 divisible_by_three = []\n not_divisible_by_three = []\n for i in range(len(l)):\n if i % 3 == 0:\n divisible_by_three.append(l[i])\n else:\n not_divisible_by_three.append(l[i])\n divisible_by_three.sort()\n result = []\n j = 0\n k = 0\n for i in range(len(l)):\n if i % 3 == 0:\n result.append(divisible_by_three[j])\n j += 1\n else:\n result.append(not_divisible_by_three[k])\n k += 1\n return result"}
{"task_id": "HumanEval/34", "completion": "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(list(set(l)))"}
{"task_id": "HumanEval/35", "completion": "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)"}
{"task_id": "HumanEval/36", "completion": "def fizz_buzz(n: int):\n count = 0\n for i in range(n):\n if i % 11 == 0 or i % 13 == 0:\n if '7' in str(i):\n count += 1\n return count"}
{"task_id": "HumanEval/37", "completion": "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 even_indices = [i for i in range(len(l)) if i % 2 == 0]\n even_values = [l[i] for i in even_indices]\n even_values.sort()\n l_prime = l.copy()\n for i in even_indices:\n l_prime[i] = even_values.pop(0)\n return l_prime"}
{"task_id": "HumanEval/38", "completion": "def decode_cyclic(s: str):\n \"\"\"\n takes as input string encoded with encode_cyclic function. Returns decoded string.\n \"\"\"\n # split string to groups. Each of length 3.\n groups = [s[(3 * i):min((3 * i + 3), len(s))] for i in range((len(s) + 2) // 3)]\n # cycle elements in each group. Unless group has fewer elements than 3.\n groups = [(group[-1] + group[:-1]) if len(group) == 3 else group for group in groups]\n return \"\".join(groups)"}
{"task_id": "HumanEval/39", "completion": "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 def is_prime(num):\n if num < 2:\n return False\n for i in range(2, int(num ** 0.5) + 1):\n if num % i == 0:\n return False\n return True\n\n def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n-1) + fibonacci(n-2)\n\n count = 0\n i = 0\n while count < n:\n i += 1\n if is_prime(fibonacci(i)):\n count += 1\n return fibonacci(i)"}
{"task_id": "HumanEval/40", "completion": "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 for i in range(len(l)):\n for j in range(i+1, len(l)):\n for k in range(j+1, len(l)):\n if l[i] + l[j] + l[k] == 0:\n return True\n return False"}
{"task_id": "HumanEval/41", "completion": "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 # The number of collisions is equal to the number of pairs of cars\n # that are moving towards each other.\n # There are n cars moving left to right and n cars moving right to left,\n # so the total number of pairs is n * n.\n return n * n"}
{"task_id": "HumanEval/42", "completion": "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 [i+1 for i in l]"}
{"task_id": "HumanEval/43", "completion": "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 for i in range(len(l)):\n for j in range(i+1, len(l)):\n if l[i] + l[j] == 0:\n return True\n return False"}
{"task_id": "HumanEval/44", "completion": "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 \"\"\"\n if x == 0:\n return '0'\n result = ''\n while x > 0:\n remainder = x % base\n result = str(remainder) + result\n x = x // base\n return result"}
{"task_id": "HumanEval/45", "completion": "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"}
{"task_id": "HumanEval/46", "completion": "def fib4(n: int):\n if n == 0:\n return 0\n elif n == 1:\n return 0\n elif n == 2:\n return 2\n elif n == 3:\n return 0\n else:\n a, b, c, d = 0, 0, 2, 0\n for i in range(4, n+1):\n d = a + b + c + d\n a, b, c = b, c, d\n return d"}
{"task_id": "HumanEval/47", "completion": "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 sorted_list = sorted(l)\n length = len(sorted_list)\n if length % 2 == 0:\n return (sorted_list[length//2 - 1] + sorted_list[length//2]) / 2\n else:\n return sorted_list[length//2]"}
{"task_id": "HumanEval/48", "completion": "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]"}
{"task_id": "HumanEval/49", "completion": "def modp(n: int, p: int) -> int:\n \"\"\"Return 2^n modulo p (be aware of numerics).\n \"\"\"\n if n == 0:\n return 1\n elif n % 2 == 0:\n return modp(n//2, p)**2 % p\n else:\n return 2 * modp(n-1, p) % p"}
{"task_id": "HumanEval/50", "completion": "def encode_shift(s: str):\n \"\"\"\n returns encoded string by shifting every character by 5 in the alphabet.\n \"\"\"\n return \"\".join([chr(((ord(ch) + 5 - ord(\"a\")) % 26) + ord(\"a\")) for ch in s])\n\n\ndef 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])"}
{"task_id": "HumanEval/51", "completion": "def remove_vowels(text):\n \"\"\"\n remove_vowels is a function that takes string and returns string without vowels.\n \"\"\"\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n result = ''\n for char in text:\n if char not in vowels:\n result += char\n return result"}
{"task_id": "HumanEval/52", "completion": "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 for num in l:\n if num >= t:\n return False\n return True"}
{"task_id": "HumanEval/53", "completion": "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"}
{"task_id": "HumanEval/54", "completion": "def same_chars(s0: str, s1: str):\n \"\"\"\n Check if two words have the same characters.\n \"\"\"\n return sorted(s0) == sorted(s1)"}
{"task_id": "HumanEval/55", "completion": "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 <= 1:\n return n\n else:\n return fib(n-1) + fib(n-2)"}
{"task_id": "HumanEval/56", "completion": "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 stack = []\n for bracket in brackets:\n if bracket == \"<\":\n stack.append(bracket)\n elif bracket == \">\":\n if not stack:\n return False\n stack.pop()\n return not stack"}
{"task_id": "HumanEval/57", "completion": "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) < 2:\n return True\n increasing = decreasing = True\n for i in range(1, len(l)):\n if l[i] > l[i-1]:\n decreasing = False\n elif l[i] < l[i-1]:\n increasing = False\n if not increasing and not decreasing:\n return False\n return True"}
{"task_id": "HumanEval/58", "completion": "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 return sorted(list(set(l1) & set(l2)))"}
{"task_id": "HumanEval/59", "completion": "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 i = 2\n while i * i <= n:\n if n % i:\n i += 1\n else:\n n //= i\n return n"}
{"task_id": "HumanEval/60", "completion": "def sum_to_n(n: int):\n \"\"\"sum_to_n is a function that sums numbers from 1 to n.\"\"\"\n return sum(range(1, n+1))"}
{"task_id": "HumanEval/61", "completion": "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 stack = []\n for bracket in brackets:\n if bracket == \"(\":\n stack.append(bracket)\n elif bracket == \")\":\n if len(stack) == 0:\n return False\n stack.pop()\n return len(stack) == 0"}
{"task_id": "HumanEval/62", "completion": "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 return [xs[i] * i for i in range(1, len(xs))]"}
{"task_id": "HumanEval/63", "completion": "def fibfib(n: int):\n if n == 0:\n return 0\n elif n == 1:\n return 0\n elif n == 2:\n return 1\n else:\n a, b, c = 0, 0, 1\n for i in range(3, n+1):\n a, b, c = b, c, a+b+c\n return c\n\nprint(fibfib(1)) # 0\nprint(fibfib(5)) # 4\nprint(fibfib(8)) # 24"}
{"task_id": "HumanEval/64", "completion": "FIX = \"\"\"\nAdd more test cases.\n\"\"\"\n\ndef 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 >>> vowels_count(\"hello\")\n 2\n >>> vowels_count(\"why\")\n 0\n >>> vowels_count(\"sky\")\n 1\n \"\"\"\n count = 0\n for letter in s:\n if letter.lower() in ['a', 'e', 'i', 'o', 'u']:\n count += 1\n if s[-1].lower() == 'y' and count > 0:\n count -= 1\n return count"}
{"task_id": "HumanEval/65", "completion": "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 x_str = str(x)\n if shift > len(x_str):\n return x_str[::-1]\n else:\n return x_str[-shift:] + x_str[:-shift]"}
{"task_id": "HumanEval/66", "completion": "def digitSum(s):\n sum = 0\n for char in s:\n if char.isupper():\n sum += ord(char)\n return sum"}
{"task_id": "HumanEval/67", "completion": "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 # Split the string into a list of words\n words = s.split()\n # Initialize variables for the number of apples and oranges\n apples = 0\n oranges = 0\n # Loop through the words and count the number of apples and oranges\n for word in words:\n if word == \"apples\":\n apples = int(words[words.index(word) - 1])\n elif word == \"oranges\":\n oranges = int(words[words.index(word) - 1])\n # Calculate the number of mangoes\n mangoes = n - apples - oranges\n return mangoes"}
{"task_id": "HumanEval/68", "completion": "def pluck(arr):\n even_values = [num for num in arr if num % 2 == 0]\n if not even_values:\n return []\n smallest_even = min(even_values)\n smallest_even_index = arr.index(smallest_even)\n return [smallest_even, smallest_even_index]"}
{"task_id": "HumanEval/69", "completion": "def search(lst):\n freq_dict = {}\n for num in lst:\n if num in freq_dict:\n freq_dict[num] += 1\n else:\n freq_dict[num] = 1\n max_num = -1\n for num in freq_dict:\n if num == freq_dict[num] and num > max_num:\n max_num = num\n return max_num"}
{"task_id": "HumanEval/70", "completion": "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 result = []\n lst.sort()\n while lst:\n result.append(lst.pop(0))\n if lst:\n result.append(lst.pop())\n return result"}
{"task_id": "HumanEval/71", "completion": "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 # calculate the semi-perimeter\n s = (a + b + c) / 2\n \n # check if the three sides form a valid triangle\n if a + b > c and a + c > b and b + c > a:\n # calculate the area using Heron's formula\n area = (s * (s - a) * (s - b) * (s - c)) ** 0.5\n return round(area, 2)\n else:\n return -1"}
{"task_id": "HumanEval/72", "completion": "def will_it_fly(q,w):\n # Check if q is a palindrome\n if q == q[::-1]:\n # Check if the sum of elements in q is less than or equal to w\n if sum(q) <= w:\n return True\n else:\n return False\n else:\n return False"}
{"task_id": "HumanEval/73", "completion": "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 count = 0\n for i in range(len(arr)//2):\n if arr[i] != arr[-i-1]:\n count += 1\n return count"}
{"task_id": "HumanEval/74", "completion": "def total_match(lst1, lst2):\n total1 = sum(len(word) for word in lst1)\n total2 = sum(len(word) for word in lst2)\n if total1 < total2:\n return lst1\n elif total2 < total1:\n return lst2\n else:\n return lst1"}
{"task_id": "HumanEval/75", "completion": "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 primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]\n count = 0\n for prime in primes:\n if a % prime == 0:\n count += 1\n if count == 3:\n return True\n else:\n return False"}
{"task_id": "HumanEval/76", "completion": "def is_simple_power(x, n):\n if x == 1:\n return True\n elif n == 1:\n return False\n else:\n i = 1\n while i <= x:\n if n**i == x:\n return True\n i += 1\n return False"}
{"task_id": "HumanEval/77", "completion": "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 elif a < 0:\n a = -a\n for i in range(1, a+1):\n if i**3 == a:\n return True\n return False"}
{"task_id": "HumanEval/78", "completion": "def hex_key(num):\n primes = ['2', '3', '5', '7', 'B', 'D']\n count = 0\n for digit in num:\n if digit in primes:\n count += 1\n return count"}
{"task_id": "HumanEval/79", "completion": "def decimal_to_binary(decimal):\n binary = bin(decimal)[2:]\n return \"db\" + binary + \"db\""}
{"task_id": "HumanEval/80", "completion": "def is_happy(s):\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"}
{"task_id": "HumanEval/81", "completion": "def numerical_letter_grade(grades):\n letter_grades = []\n for grade in grades:\n if grade == 4.0:\n letter_grades.append('A+')\n elif grade > 3.7:\n letter_grades.append('A')\n elif grade > 3.3:\n letter_grades.append('A-')\n elif grade > 3.0:\n letter_grades.append('B+')\n elif grade > 2.7:\n letter_grades.append('B')\n elif grade > 2.3:\n letter_grades.append('B-')\n elif grade > 2.0:\n letter_grades.append('C+')\n elif grade > 1.7:\n letter_grades.append('C')\n elif grade > 1.3:\n letter_grades.append('C-')\n elif grade > 1.0:\n letter_grades.append('D+')\n elif grade > 0.7:\n letter_grades.append('D')\n elif grade > 0.0:\n letter_grades.append('D-')\n else:\n letter_grades.append('E')\n return letter_grades"}
{"task_id": "HumanEval/82", "completion": "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 length = len(string)\n if length < 2:\n return False\n for i in range(2, int(length ** 0.5) + 1):\n if length % i == 0:\n return False\n return True"}
{"task_id": "HumanEval/83", "completion": "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 count = 0\n if n == 1:\n return 2\n else:\n count += 2 * 9 * (10 ** (n-2))\n count += starts_one_ends(n-1)\n return count"}
{"task_id": "HumanEval/84", "completion": "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 binary_sum = 0\n while N > 0:\n binary_sum += N % 2\n N //= 2\n return bin(binary_sum)[2:]"}
{"task_id": "HumanEval/85", "completion": "def add(lst):\n \"\"\"Given a non-empty list of integers lst. add the even elements that are at odd indices.\n\n Examples:\n add([4, 2, 6, 7]) ==> 2 \n \"\"\"\n total = 0\n for i in range(1, len(lst), 2):\n if lst[i] % 2 == 0:\n total += lst[i]\n return total"}
{"task_id": "HumanEval/86", "completion": "def anti_shuffle(s):\n words = s.split()\n new_words = []\n for word in words:\n new_word = ''.join(sorted(word))\n new_words.append(new_word)\n return ' '.join(new_words)"}
{"task_id": "HumanEval/87", "completion": "def get_row(lst, x):\n result = []\n for i in range(len(lst)):\n if x in lst[i]:\n for j in range(len(lst[i])):\n if lst[i][j] == x:\n result.append((i, j))\n result.sort(key=lambda x: x[0])\n result.sort(key=lambda x: x[1], reverse=True)\n return result"}
{"task_id": "HumanEval/88", "completion": "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 sorted_array = array.copy()\n if len(sorted_array) < 2:\n return sorted_array\n if (sorted_array[0] + sorted_array[-1]) % 2 == 0:\n sorted_array.sort(reverse=True)\n else:\n sorted_array.sort()\n return sorted_array"}
{"task_id": "HumanEval/89", "completion": "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 alphabet = 'abcdefghijklmnopqrstuvwxyz'\n new_alphabet = alphabet[2*2:] + alphabet[:2*2]\n return s.translate(str.maketrans(alphabet, new_alphabet))"}
{"task_id": "HumanEval/90", "completion": "def next_smallest(lst):\n if len(lst) < 2:\n return None\n else:\n sorted_lst = sorted(set(lst))\n if len(sorted_lst) < 2:\n return None\n else:\n return sorted_lst[1]"}
{"task_id": "HumanEval/91", "completion": "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 sentences = S.split('.')\n sentences += S.split('?')\n sentences += S.split('!')\n count = 0\n for sentence in sentences:\n if sentence.strip().startswith('I'):\n count += 1\n return count"}
{"task_id": "HumanEval/92", "completion": "def any_int(x, y, z):\n if isinstance(x, int) and isinstance(y, int) and isinstance(z, int):\n if x == y + z or y == x + z or z == x + y:\n return True\n else:\n return False\n else:\n return False"}
{"task_id": "HumanEval/93", "completion": "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 = 'aeiouAEIOU'\n encoded_message = ''\n for letter in message:\n if letter in vowels:\n encoded_message += chr(ord(letter) + 2)\n else:\n encoded_message += letter.swapcase()\n return encoded_message"}
{"task_id": "HumanEval/94", "completion": "def skjkasdkd(lst):\n def is_prime(n):\n if n < 2:\n return False\n for i in range(2, int(n**0.5)+1):\n if n % i == 0:\n return False\n return True\n \n max_prime = 0\n for num in lst:\n if is_prime(num) and num > max_prime:\n max_prime = num\n \n return sum(int(digit) for digit in str(max_prime)) if max_prime != 0 else 0"}
{"task_id": "HumanEval/95", "completion": "def check_dict_case(dict):\n if len(dict) == 0:\n return False\n lower = False\n upper = False\n for key in dict.keys():\n if not isinstance(key, str):\n return False\n if key.islower():\n lower = True\n elif key.isupper():\n upper = True\n else:\n return False\n return lower != upper"}
{"task_id": "HumanEval/96", "completion": "def count_up_to(n):\n primes = []\n for num in range(2, n):\n for i in range(2, num):\n if (num % i) == 0:\n break\n else:\n primes.append(num)\n return primes"}
{"task_id": "HumanEval/97", "completion": "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 a = abs(a) % 10\n b = abs(b) % 10\n return a * b"}
{"task_id": "HumanEval/98", "completion": "def count_upper(s):\n count = 0\n vowels = ['A', 'E', 'I', 'O', 'U']\n for i in range(0, len(s), 2):\n if s[i] in vowels and s[i].isupper():\n count += 1\n return count"}
{"task_id": "HumanEval/99", "completion": "def closest_integer(value):\n num = float(value)\n if num >= 0:\n return int(num + 0.5)\n else:\n return int(num - 0.5)"}
{"task_id": "HumanEval/100", "completion": "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 pile = [n]\n for i in range(1, n):\n if n % 2 == 0:\n pile.append(n + 2*i)\n else:\n pile.append(n + 2*i - 1)\n return pile"}
{"task_id": "HumanEval/101", "completion": "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 words = s.replace(\",\", \" \").split()\n return words"}
{"task_id": "HumanEval/102", "completion": "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 max_even = -1\n for i in range(x, y+1):\n if i % 2 == 0 and i > max_even:\n max_even = i\n return max_even"}
{"task_id": "HumanEval/103", "completion": "def rounded_avg(n, m):\n if n > m:\n return -1\n else:\n avg = round(sum(range(n, m+1)) / (m-n+1))\n return bin(avg)[2:]"}
{"task_id": "HumanEval/104", "completion": "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 result = []\n for num in x:\n if all(int(digit) % 2 != 0 for digit in str(num)):\n result.append(num)\n return sorted(result)"}
{"task_id": "HumanEval/105", "completion": "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 names = [\"\", \"One\", \"Two\", \"Three\", \"Four\", \"Five\", \"Six\", \"Seven\", \"Eight\", \"Nine\"]\n arr = sorted([x for x in arr if 0 < x < 10], reverse=True)\n return [names[x] for x in arr]"}
{"task_id": "HumanEval/106", "completion": "def f(n):\n result = []\n for i in range(1, n+1):\n if i % 2 == 0:\n fact = 1\n for j in range(1, i+1):\n fact *= j\n result.append(fact)\n else:\n result.append(sum(range(1, i+1)))\n return result"}
{"task_id": "HumanEval/107", "completion": "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 even_count = 0\n odd_count = 0\n for i in range(1, n+1):\n if str(i) == str(i)[::-1]:\n if i % 2 == 0:\n even_count += 1\n else:\n odd_count += 1\n return (even_count, odd_count)"}
{"task_id": "HumanEval/108", "completion": "def count_nums(arr):\n count = 0\n for num in arr:\n digits_sum = sum(int(digit) for digit in str(abs(num)))\n if digits_sum > 0:\n count += 1\n return count"}
{"task_id": "HumanEval/109", "completion": "def move_one_ball(arr):\n if not arr:\n return True\n n = len(arr)\n for i in range(n):\n if arr == sorted(arr):\n return True\n arr = [arr[-1]] + arr[:-1]\n return False"}
{"task_id": "HumanEval/110", "completion": "def exchange(lst1, lst2):\n # Count the number of odd numbers in lst1\n odd_count = sum([1 for num in lst1 if num % 2 != 0])\n \n # If there are no odd numbers in lst1, return \"YES\"\n if odd_count == 0:\n return \"YES\"\n \n # Count the number of even numbers in lst2\n even_count = sum([1 for num in lst2 if num % 2 == 0])\n \n # If there are not enough even numbers in lst2 to replace the odd numbers in lst1, return \"NO\"\n if even_count < odd_count:\n return \"NO\"\n \n # Sort lst1 in ascending order\n lst1.sort()\n \n # Sort lst2 in descending order\n lst2.sort(reverse=True)\n \n # Replace the odd numbers in lst1 with even numbers from lst2\n for i in range(len(lst1)):\n if lst1[i] % 2 != 0:\n for j in range(len(lst2)):\n if lst2[j] % 2 == 0:\n lst1[i] = lst2[j]\n lst2[j] = -1\n break\n \n # Check if lst1 contains only even numbers\n for num in lst1:\n if num % 2 != 0:\n return \"NO\"\n \n return \"YES\""}
{"task_id": "HumanEval/111", "completion": "def histogram(test):\n \"\"\"\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:\n return {}\n\n letters = test.split()\n counts = {}\n\n for letter in letters:\n if letter in counts:\n counts[letter] += 1\n else:\n counts[letter] = 1\n\n max_count = max(counts.values())\n result = {}\n\n for letter, count in counts.items():\n if count == max_count:\n result[letter] = count\n\n return result"}
{"task_id": "HumanEval/112", "completion": "def reverse_delete(s,c):\n # Delete all characters in s that are in c\n for char in c:\n s = s.replace(char, \"\")\n \n # Check if the resulting string is a palindrome\n if s == s[::-1]:\n return (s, True)\n else:\n return (s, False)"}
{"task_id": "HumanEval/113", "completion": "def odd_count(lst):\n result = []\n for string in lst:\n count = 0\n for digit in string:\n if int(digit) % 2 != 0:\n count += 1\n result.append(\"the number of odd elements in the string {} of the input.\".format(count))\n return result"}
{"task_id": "HumanEval/114", "completion": "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 n = len(nums)\n min_sum = float('inf')\n curr_sum = 0\n for i in range(n):\n curr_sum += nums[i]\n min_sum = min(min_sum, curr_sum)\n curr_sum = max(curr_sum, 0)\n return min_sum"}
{"task_id": "HumanEval/115", "completion": "def max_fill(grid, capacity):\n import math\n \n # Initialize variables\n num_buckets = 0\n total_water = sum(sum(row) for row in grid)\n \n # If there is no water, return 0\n if total_water == 0:\n return 0\n \n # Calculate the number of buckets needed\n num_buckets = math.ceil(total_water / capacity)\n \n return num_buckets"}
{"task_id": "HumanEval/116", "completion": "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(num):\n return bin(num).count('1')\n \n return sorted(arr, key=lambda x: (count_ones(x), x))"}
{"task_id": "HumanEval/117", "completion": "def select_words(s, n):\n # Split the string into a list of words\n words = s.split()\n # Create an empty list to store the words with n consonants\n result = []\n # Loop through each word in the list\n for word in words:\n # Count the number of consonants in the word\n consonants = sum(1 for letter in word if letter.lower() not in \"aeiou\")\n # If the word has n consonants, add it to the result list\n if consonants == n:\n result.append(word)\n # Return the result list\n return result"}
{"task_id": "HumanEval/118", "completion": "def get_closest_vowel(word):\n vowels = set(['a', 'e', 'i', 'o', 'u'])\n word = word.lower()\n for i in range(len(word)-2, 0, -1):\n if word[i] in vowels and word[i-1] not in vowels and word[i+1] not in vowels:\n return word[i].upper() if word[i].isupper() else word[i]\n return \"\""}
{"task_id": "HumanEval/119", "completion": "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 # concatenate the two strings\n s = lst[0] + lst[1]\n # initialize a stack to keep track of open parentheses\n stack = []\n # iterate through the string\n for c in s:\n # if the character is an open parenthesis, add it to the stack\n if c == '(':\n stack.append(c)\n # if the character is a close parenthesis, check if the stack is empty\n # if the stack is empty, return 'No' because there is no open parenthesis to match it\n # if the stack is not empty, pop the top element from the stack\n else:\n if not stack:\n return 'No'\n stack.pop()\n # if the stack is empty, all parentheses are balanced and the string is good\n # otherwise, there are open parentheses without a matching close parenthesis and the string is not good\n return 'Yes' if not stack else 'No'"}
{"task_id": "HumanEval/120", "completion": "def maximum(arr, k):\n arr.sort()\n return arr[-k:]"}
{"task_id": "HumanEval/121", "completion": "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 return sum(lst[i] for i in range(0, len(lst), 2) if lst[i] % 2 != 0)"}
{"task_id": "HumanEval/122", "completion": "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 sum = 0\n for i in range(k):\n if arr[i] >= 10 and arr[i] <= 99:\n sum += arr[i]\n return sum"}
{"task_id": "HumanEval/123", "completion": "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 collatz_seq = [n]\n while n != 1:\n if n % 2 == 0:\n n = n // 2\n else:\n n = 3 * n + 1\n collatz_seq.append(n)\n return sorted(list(set(filter(lambda x: x % 2 == 1, collatz_seq))))\n\n\nprint(get_odd_collatz(5)) # [1, 5]\nprint(get_odd_collatz(10)) # [1, 5, 7]\nprint(get_odd_collatz(1)) # [1]"}
{"task_id": "HumanEval/124", "completion": "def valid_date(date):\n if len(date) != 10:\n return False\n if date[2] != '-' or date[5] != '-':\n return False\n month = int(date[0:2])\n day = int(date[3:5])\n year = int(date[6:])\n if month < 1 or month > 12:\n return False\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 year % 4 == 0:\n if day < 1 or day > 29:\n return False\n else:\n if day < 1 or day > 28:\n return False\n else:\n return False\n return True"}
{"task_id": "HumanEval/125", "completion": "def split_words(txt):\n words = txt.split()\n if len(words) == 1:\n words = txt.split(',')\n if len(words) == 1:\n count = sum(1 for c in txt if c.islower() and ord(c) % 2 == 1)\n return count\n return words"}
{"task_id": "HumanEval/126", "completion": "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 for i in range(len(lst)-1):\n if lst[i] >= lst[i+1]:\n return False\n for i in lst:\n if lst.count(i) > 1:\n return False\n return True"}
{"task_id": "HumanEval/127", "completion": "def is_prime(n):\n if n < 2:\n return False\n for i in range(2, int(n**0.5)+1):\n if n % i == 0:\n return False\n return True\n\ndef intersection(interval1, interval2):\n start1, end1 = interval1\n start2, end2 = interval2\n if end1 < start2 or end2 < start1:\n return \"NO\"\n intersection_start = max(start1, start2)\n intersection_end = min(end1, end2)\n intersection_length = intersection_end - intersection_start + 1\n if is_prime(intersection_length):\n return \"YES\"\n else:\n return \"NO\""}
{"task_id": "HumanEval/128", "completion": "def prod_signs(arr):\n if not arr:\n return None\n sign_prod = 1\n mag_sum = 0\n for num in arr:\n if num == 0:\n sign_prod = 0\n elif num < 0:\n sign_prod *= -1\n mag_sum += abs(num)\n return sign_prod * mag_sum"}
{"task_id": "HumanEval/129", "completion": "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 visited = set()\n heap = [(grid[i][0], [(i, 0)]) for i in range(n)]\n heapq.heapify(heap)\n while heap:\n cost, path = heapq.heappop(heap)\n if len(path) == k:\n return [grid[i][j] for i, j in path]\n i, j = path[-1]\n visited.add((i, j))\n for ni, nj in [(i-1, j), (i+1, j), (i, j-1), (i, j+1)]:\n if 0 <= ni < n and 0 <= nj < n and (ni, nj) not in visited:\n heapq.heappush(heap, (cost + grid[ni][nj], path + [(ni, nj)]))\n return []"}
{"task_id": "HumanEval/130", "completion": "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 elif n == 1:\n return [3]\n else:\n seq = [3, 1]\n for i in range(2, n+1):\n if i % 2 == 0:\n seq.append(1 + i//2)\n else:\n seq.append(seq[i-1] + seq[i-2] + seq[i+1])\n return seq"}
{"task_id": "HumanEval/131", "completion": "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 for digit in str(n):\n if int(digit) % 2 == 1:\n product *= int(digit)\n if product == 1:\n return 0\n else:\n return product"}
{"task_id": "HumanEval/132", "completion": "def is_nested(string):\n stack = []\n for bracket in string:\n if bracket == '[':\n stack.append(bracket)\n elif bracket == ']':\n if len(stack) > 0 and stack[-1] == '[':\n stack.pop()\n else:\n stack.append(bracket)\n return len(stack) < len(string) and len(stack) > 0"}
{"task_id": "HumanEval/133", "completion": "def sum_squares(lst):\n total = 0\n for num in lst:\n total += int(num)**2\n return total"}
{"task_id": "HumanEval/134", "completion": "def check_if_last_char_is_a_letter(txt):\n if len(txt) == 0:\n return False\n elif not txt[-1].isalpha():\n return False\n elif len(txt.split()[-1]) > 1:\n return False\n else:\n return True"}
{"task_id": "HumanEval/135", "completion": "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 for i in range(len(arr)-1, 0, -1):\n if arr[i] < arr[i-1]:\n return i-1\n return -1"}
{"task_id": "HumanEval/136", "completion": "def largest_smallest_integers(lst):\n neg_ints = [i for i in lst if i < 0]\n pos_ints = [i for i in lst if i > 0]\n if len(neg_ints) == 0:\n a = None\n else:\n a = max(neg_ints)\n if len(pos_ints) == 0:\n b = None\n else:\n b = min(pos_ints)\n return (a, b)"}
{"task_id": "HumanEval/137", "completion": "def compare_one(a, b):\n if type(a) == type(b):\n if type(a) == int or type(a) == float:\n if a > b:\n return a\n elif b > a:\n return b\n else:\n return None\n elif type(a) == str:\n a = a.replace(\",\", \".\")\n b = b.replace(\",\", \".\")\n if float(a) > float(b):\n return a\n elif float(b) > float(a):\n return b\n else:\n return None\n else:\n return None"}
{"task_id": "HumanEval/138", "completion": "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 if n % 2 != 0 or n < 8:\n return False\n else:\n return True"}
{"task_id": "HumanEval/139", "completion": "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 if n == 1:\n return 1\n else:\n return n * special_factorial(n-1) * special_factorial(n-1)"}
{"task_id": "HumanEval/140", "completion": "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 text = text.replace(\" \", \"_\")\n count = 0\n new_text = \"\"\n for i in range(len(text)):\n if text[i] == \" \":\n count += 1\n if count > 2:\n continue\n else:\n new_text += text[i]\n else:\n count = 0\n new_text += text[i]\n new_text = new_text.replace(\" \", \"-\")\n return new_text"}
{"task_id": "HumanEval/141", "completion": "def file_name_check(file_name):\n digits = '0123456789'\n alphabets = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'\n extensions = ['txt', 'exe', 'dll']\n if file_name.count('.') != 1:\n return 'No'\n name, ext = file_name.split('.')\n if not name or not name[0] in alphabets:\n return 'No'\n if ext not in extensions:\n return 'No'\n if sum([1 for char in name if char in digits]) > 3:\n return 'No'\n return 'Yes'"}
{"task_id": "HumanEval/142", "completion": "def sum_squares(lst):\n total = 0\n for i in range(len(lst)):\n if i % 3 == 0:\n total += lst[i]**2\n elif i % 4 == 0 and i % 3 != 0:\n total += lst[i]**3\n else:\n total += lst[i]\n return total"}
{"task_id": "HumanEval/143", "completion": "def is_prime(n):\n if n < 2:\n return False\n for i in range(2, int(n**0.5)+1):\n if n % i == 0:\n return False\n return True\n\ndef words_in_sentence(sentence):\n words = sentence.split()\n result = []\n for word in words:\n if is_prime(len(word)):\n result.append(word)\n return ' '.join(result)"}
{"task_id": "HumanEval/144", "completion": "def simplify(x, n):\n # Convert the fractions to integers\n x_num, x_den = map(int, x.split('/'))\n n_num, n_den = map(int, n.split('/'))\n \n # Multiply the numerators and denominators\n num = x_num * n_num\n den = x_den * n_den\n \n # Check if the result is a whole number\n if num % den == 0:\n return True\n else:\n return False"}
{"task_id": "HumanEval/145", "completion": "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(num):\n return sum(int(digit) for digit in str(abs(num)))\n\n return sorted(nums, key=lambda num: (digit_sum(num), nums.index(num))) if nums else []"}
{"task_id": "HumanEval/146", "completion": "def specialFilter(nums):\n count = 0\n for num in nums:\n if num > 10 and str(num)[0] in ['1', '3', '5', '7', '9'] and str(num)[-1] in ['1', '3', '5', '7', '9']:\n count += 1\n return count"}
{"task_id": "HumanEval/147", "completion": "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 a = [i*i-i+1 for i in range(1, n+1)]\n count = 0\n for i in range(n-2):\n for j in range(i+1, n-1):\n for k in range(j+1, n):\n if (a[i]+a[j]+a[k])%3 == 0:\n count += 1\n return count"}
{"task_id": "HumanEval/148", "completion": "def bf(planet1, planet2):\n planets = [\"Mercury\", \"Venus\", \"Earth\", \"Mars\", \"Jupiter\", \"Saturn\", \"Uranus\", \"Neptune\"]\n if planet1 not in planets or planet2 not in planets:\n return ()\n index1 = planets.index(planet1)\n index2 = planets.index(planet2)\n if index1 > index2:\n index1, index2 = index2, index1\n return tuple(sorted(planets[index1+1:index2], key=lambda x: planets.index(x)))"}
{"task_id": "HumanEval/149", "completion": "def sorted_list_sum(lst):\n # create a new list to store the even length strings\n even_lst = []\n for word in lst:\n # check if the length of the word is even\n if len(word) % 2 == 0:\n even_lst.append(word)\n # sort the even length strings by length and then alphabetically\n even_lst.sort(key=lambda x: (len(x), x))\n return even_lst"}
{"task_id": "HumanEval/150", "completion": "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 # Check if n is a prime number\n if n > 1:\n for i in range(2, n):\n if n % i == 0:\n break\n else:\n return x\n \n # If n is not a prime number, return y\n return y\n\n# Examples\nprint(x_or_y(7, 34, 12)) # Output: 34\nprint(x_or_y(15, 8, 5)) # Output: 5"}
{"task_id": "HumanEval/151", "completion": "def double_the_difference(lst):\n sum_of_squares = 0\n for num in lst:\n if isinstance(num, int) and num >= 0 and num % 2 != 0:\n sum_of_squares += num ** 2\n return sum_of_squares * 2"}
{"task_id": "HumanEval/152", "completion": "def compare(game,guess):\n result = []\n for i in range(len(game)):\n if game[i] == guess[i]:\n result.append(0)\n else:\n result.append(abs(game[i] - guess[i]))\n return result"}
{"task_id": "HumanEval/153", "completion": "def Strongest_Extension(class_name, extensions):\n strongest = None\n for extension in extensions:\n cap = sum(1 for c in extension if c.isupper())\n sm = sum(1 for c in extension if c.islower())\n strength = cap - sm\n if strongest is None or strength > strongest[1]:\n strongest = (extension, strength)\n return f\"{class_name}.{strongest[0]}\""}
{"task_id": "HumanEval/154", "completion": "def cycpattern_check(a , b):\n for i in range(len(b)):\n if b[i:] + b[:i] in a:\n return True\n return False"}
{"task_id": "HumanEval/155", "completion": "def even_odd_count(num):\n even_count = 0\n odd_count = 0\n for digit in str(abs(num)):\n if int(digit) % 2 == 0:\n even_count += 1\n else:\n odd_count += 1\n if num < 0:\n return (odd_count, even_count)\n else:\n return (even_count, odd_count)"}
{"task_id": "HumanEval/156", "completion": "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 roman_numerals = {\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 result = ''\n for value, numeral in roman_numerals.items():\n while number >= value:\n result += numeral\n number -= value\n return result.lower()"}
{"task_id": "HumanEval/157", "completion": "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 sides = [a, b, c]\n sides.sort()\n if sides[0]**2 + sides[1]**2 == sides[2]**2:\n return True\n else:\n return False"}
{"task_id": "HumanEval/158", "completion": "def find_max(words):\n max_word = \"\"\n max_count = 0\n for word in words:\n unique_chars = set(word)\n if len(unique_chars) > max_count:\n max_word = word\n max_count = len(unique_chars)\n elif len(unique_chars) == max_count:\n max_word = min(max_word, word)\n return max_word"}
{"task_id": "HumanEval/159", "completion": "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 total_eaten = number + remaining\n if total_eaten >= need:\n total_eaten = need\n remaining = total_eaten - number\n else:\n remaining = 0\n return [total_eaten, remaining]"}
{"task_id": "HumanEval/160", "completion": "def do_algebra(operator, operand):\n expression = str(operand[0])\n for i in range(len(operator)):\n expression += operator[i] + str(operand[i+1])\n return eval(expression)"}
{"task_id": "HumanEval/161", "completion": "def solve(s):\n new_s = \"\"\n has_letter = False\n for char in s:\n if char.isalpha():\n has_letter = True\n if char.islower():\n new_s += char.upper()\n else:\n new_s += char.lower()\n else:\n new_s += char\n if not has_letter:\n new_s = new_s[::-1]\n return new_s"}
{"task_id": "HumanEval/162", "completion": "import hashlib\n\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 else:\n return hashlib.md5(text.encode()).hexdigest()"}
{"task_id": "HumanEval/163", "completion": "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 even_digits = []\n for num in range(a, b+1):\n for digit in str(num):\n if int(digit) % 2 == 0:\n even_digits.append(int(digit))\n return sorted(set(even_digits)) if even_digits else []"}