INSTRUCTION
stringlengths 78
1.13k
| RESPONSE
stringlengths 36
906
| SOURCE
stringclasses 2
values |
---|---|---|

Write a Python function which follows this instruction: Check if in given list of numbers, are any two numbers closer to each other than given threshold. | from typing import List
def has_close_elements(numbers: List[float], threshold: float) -> bool:
for idx, elem in enumerate(numbers):
for idx2, elem2 in enumerate(numbers):
if idx != idx2:
distance = abs(elem - elem2)
if distance < threshold:
return True
return False | HumanEval |

Write a Python function which follows this instruction: Input to this function is a string containing multiple groups of nested parentheses. Your goal is to separate those group into separate strings and return the list of those. Separate groups are balanced (each open brace is properly closed) and not nested within each other Ignore any spaces in the input string. | from typing import List
def separate_paren_groups(paren_string: str) -> List[str]:
result = []
current_string = []
current_depth = 0
for c in paren_string:
if c == '(':
current_depth += 1
current_string.append(c)
elif c == ')':
current_depth -= 1
current_string.append(c)
if current_depth == 0:
result.append(''.join(current_string))
current_string.clear()
return result | HumanEval |

Write a Python function which follows this instruction: Given a positive floating point number, it can be decomposed into and integer part (largest integer smaller than given number) and decimals (leftover part always smaller than 1). Return the decimal part of the number. |
def truncate_number(number: float) -> float:
return number % 1.0 | HumanEval |

Write a Python function which follows this instruction: You're given a list of deposit and withdrawal operations on a bank account that starts with zero balance. Your task is to detect if at any point the balance of account fallls below zero, and at that point function should return True. Otherwise it should return False. | from typing import List
def below_zero(operations: List[int]) -> bool:
balance = 0
for op in operations:
balance += op
if balance < 0:
return True
return False | HumanEval |

Write a Python function which follows this instruction: For a given list of input numbers, calculate Mean Absolute Deviation around the mean of this dataset. Mean Absolute Deviation is the average absolute difference between each element and a centerpoint (mean in this case): MAD = average | x - x_mean | | from typing import List
def mean_absolute_deviation(numbers: List[float]) -> float:
mean = sum(numbers) / len(numbers)
return sum(abs(x - mean) for x in numbers) / len(numbers) | HumanEval |

Write a Python function which follows this instruction: Insert a number 'delimeter' between every two consecutive elements of input list `numbers' | from typing import List
def intersperse(numbers: List[int], delimeter: int) -> List[int]:
if not numbers:
return []
result = []
for n in numbers[:-1]:
result.append(n)
result.append(delimeter)
result.append(numbers[-1])
return result | HumanEval |

Write a Python function which follows this instruction: Input to this function is a string represented multiple groups for nested parentheses separated by spaces. For each of the group, output the deepest level of nesting of parentheses. E.g. (()()) has maximum two levels of nesting while ((())) has three. | from typing import List
def parse_nested_parens(paren_string: str) -> List[int]:
def parse_paren_group(s):
depth = 0
max_depth = 0
for c in s:
if c == '(':
depth += 1
max_depth = max(depth, max_depth)
else:
depth -= 1
return max_depth
return [parse_paren_group(x) for x in paren_string.split(' ') if x] | HumanEval |

Write a Python function which follows this instruction: Filter an input list of strings only for ones that contain given substring | from typing import List
def filter_by_substring(strings: List[str], substring: str) -> List[str]:
return [x for x in strings if substring in x] | HumanEval |

Write a Python function which follows this instruction: For a given list of integers, return a tuple consisting of a sum and a product of all the integers in a list. Empty sum should be equal to 0 and empty product should be equal to 1. | from typing import List, Tuple
def sum_product(numbers: List[int]) -> Tuple[int, int]:
sum_value = 0
prod_value = 1
for n in numbers:
sum_value += n
prod_value *= n
return sum_value, prod_value | HumanEval |

Write a Python function which follows this instruction: From a given list of integers, generate a list of rolling maximum element found until given moment in the sequence. | from typing import List, Tuple
def rolling_max(numbers: List[int]) -> List[int]:
running_max = None
result = []
for n in numbers:
if running_max is None:
running_max = n
else:
running_max = max(running_max, n)
result.append(running_max)
return result | HumanEval |

Write a Python function which follows this instruction: Test if given string is a palindrome return string == string[::-1] def make_palindrome(string: str) -> str: |
def is_palindrome(string: str) -> bool:
if not string:
return ''
beginning_of_suffix = 0
while not is_palindrome(string[beginning_of_suffix:]):
beginning_of_suffix += 1
return string + string[:beginning_of_suffix][::-1] | HumanEval |

Write a Python function which follows this instruction: Input are two strings a and b consisting only of 1s and 0s. Perform binary XOR on these inputs and return result also as a string. | from typing import List
def string_xor(a: str, b: str) -> str:
def xor(i, j):
if i == j:
return '0'
else:
return '1'
return ''.join(xor(x, y) for x, y in zip(a, b)) | HumanEval |

Write a Python function which follows this instruction: Out of list of strings, return the longest one. Return the first one in case of multiple strings of the same length. Return None in case the input list is empty. | from typing import List, Optional
def longest(strings: List[str]) -> Optional[str]:
if not strings:
return None
maxlen = max(len(x) for x in strings)
for s in strings:
if len(s) == maxlen:
return s | HumanEval |

Write a Python function which follows this instruction: Return a greatest common divisor of two integers a and b |
def greatest_common_divisor(a: int, b: int) -> int:
while b:
a, b = b, a % b
return a | HumanEval |

Write a Python function which follows this instruction: Return list of all prefixes from shortest to longest of the input string | from typing import List
def all_prefixes(string: str) -> List[str]:
result = []
for i in range(len(string)):
result.append(string[:i+1])
return result | HumanEval |

Write a Python function which follows this instruction: Return a string containing space-delimited numbers starting from 0 upto n inclusive. |
def string_sequence(n: int) -> str:
return ' '.join([str(x) for x in range(n + 1)]) | HumanEval |

Write a Python function which follows this instruction: Given a string, find out how many distinct characters (regardless of case) does it consist of |
def count_distinct_characters(string: str) -> int:
return len(set(string.lower())) | HumanEval |

Write a Python function which follows this instruction: Input to this function is a string representing musical notes in a special ASCII format. Your task is to parse this string and return list of integers corresponding to how many beats does each not last. Here is a legend: 'o' - whole note, lasts four beats 'o|' - half note, lasts two beats '.|' - quater note, lasts one beat | from typing import List
def parse_music(music_string: str) -> List[int]:
note_map = {'o': 4, 'o|': 2, '.|': 1}
return [note_map[x] for x in music_string.split(' ') if x] | HumanEval |

Write a Python function which follows this instruction: Find how many times a given substring can be found in the original string. Count overlaping cases. |
def how_many_times(string: str, substring: str) -> int:
times = 0
for i in range(len(string) - len(substring) + 1):
if string[i:i+len(substring)] == substring:
times += 1
return times | HumanEval |

Write a Python function which follows this instruction: Input is a space-delimited string of numberals from 'zero' to 'nine'. Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'. Return the string with numbers sorted from smallest to largest | from typing import List
def sort_numbers(numbers: str) -> str:
value_map = {
'zero': 0,
'one': 1,
'two': 2,
'three': 3,
'four': 4,
'five': 5,
'six': 6,
'seven': 7,
'eight': 8,
'nine': 9
}
return ' '.join(sorted([x for x in numbers.split(' ') if x], key=lambda x: value_map[x])) | HumanEval |

Write a Python function which follows this instruction: From a supplied list of numbers (of length at least two) select and return two that are the closest to each other and return them in order (smaller number, larger number). | from typing import List, Tuple
def find_closest_elements(numbers: List[float]) -> Tuple[float, float]:
closest_pair = None
distance = None
for idx, elem in enumerate(numbers):
for idx2, elem2 in enumerate(numbers):
if idx != idx2:
if distance is None:
distance = abs(elem - elem2)
closest_pair = tuple(sorted([elem, elem2]))
else:
new_distance = abs(elem - elem2)
if new_distance < distance:
distance = new_distance
closest_pair = tuple(sorted([elem, elem2]))
return closest_pair | HumanEval |

Write a Python function which follows this instruction: Given list of numbers (of at least two elements), apply a linear transform to that list, such that the smallest number will become 0 and the largest will become 1 | from typing import List
def rescale_to_unit(numbers: List[float]) -> List[float]:
min_number = min(numbers)
max_number = max(numbers)
return [(x - min_number) / (max_number - min_number) for x in numbers] | HumanEval |

Write a Python function which follows this instruction: Filter given list of any python values only for integers | from typing import List, Any
def filter_integers(values: List[Any]) -> List[int]:
return [x for x in values if isinstance(x, int)] | HumanEval |

Write a Python function which follows this instruction: Return length of given string |
def strlen(string: str) -> int:
return len(string) | HumanEval |

Write a Python function which follows this instruction: For a given number n, find the largest number that divides n evenly, smaller than n |
def largest_divisor(n: int) -> int:
for i in reversed(range(n)):
if n % i == 0:
return i | HumanEval |

Write a Python function which follows this instruction: Return list of prime factors of given integer in the order from smallest to largest. Each of the factors should be listed number of times corresponding to how many times it appeares in factorization. Input number should be equal to the product of all factors | from typing import List
def factorize(n: int) -> List[int]:
import math
fact = []
i = 2
while i <= int(math.sqrt(n) + 1):
if n % i == 0:
fact.append(i)
n //= i
else:
i += 1
if n > 1:
fact.append(n)
return fact | HumanEval |

Write a Python function which follows this instruction: From a list of integers, remove all elements that occur more than once. Keep order of elements left the same as in the input. | from typing import List
def remove_duplicates(numbers: List[int]) -> List[int]:
import collections
c = collections.Counter(numbers)
return [n for n in numbers if c[n] <= 1] | HumanEval |

Write a Python function which follows this instruction: For a given string, flip lowercase characters to uppercase and uppercase to lowercase. |
def flip_case(string: str) -> str:
return string.swapcase() | HumanEval |

Write a Python function which follows this instruction: Concatenate list of strings into a single string | from typing import List
def concatenate(strings: List[str]) -> str:
return ''.join(strings) | HumanEval |

Write a Python function which follows this instruction: Filter an input list of strings only for ones that start with a given prefix. | from typing import List
def filter_by_prefix(strings: List[str], prefix: str) -> List[str]:
return [x for x in strings if x.startswith(prefix)] | HumanEval |

Write a Python function which follows this instruction: Return only positive numbers in the list. |
def get_positive(l: list):
return [e for e in l if e > 0] | HumanEval |

Write a Python function which follows this instruction: Return true if a given number is prime, and false otherwise. |
def is_prime(n):
if n < 2:
return False
for k in range(2, n - 1):
if n % k == 0:
return False
return True | HumanEval |

Write a Python function which follows this instruction: Evaluates polynomial with coefficients xs at point x. return xs[0] + xs[1] * x + xs[1] * x^2 + .... xs[n] * x^n | import math
def poly(xs: list, x: float):
begin, end = -1., 1.
while poly(xs, begin) * poly(xs, end) > 0:
begin *= 2.0
end *= 2.0
while end - begin > 1e-10:
center = (begin + end) / 2.0
if poly(xs, center) * poly(xs, begin) > 0:
begin = center
else:
end = center
return begin | HumanEval |

Write a Python function which follows this instruction: This function takes a list l and returns a list l' such that l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal to the values of the corresponding indicies of l, but sorted. |
def sort_third(l: list):
l = list(l)
l[::3] = sorted(l[::3])
return l | HumanEval |

Write a Python function which follows this instruction: Return sorted unique elements in a list |
def unique(l: list):
return sorted(list(set(l))) | HumanEval |

Write a Python function which follows this instruction: Return maximum element in the list. |
def max_element(l: list):
m = l[0]
for e in l:
if e > m:
m = e
return m | HumanEval |

Write a Python function which follows this instruction: Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13. |
def fizz_buzz(n: int):
ns = []
for i in range(n):
if i % 11 == 0 or i % 13 == 0:
ns.append(i)
s = ''.join(list(map(str, ns)))
ans = 0
for c in s:
ans += (c == '7')
return ans | HumanEval |

Write a Python function which follows this instruction: This function takes a list l and returns a list l' such that l' is identical to l in the odd indicies, while its values at the even indicies are equal to the values of the even indicies of l, but sorted. |
def sort_even(l: list):
evens = l[::2]
odds = l[1::2]
evens.sort()
ans = []
for e, o in zip(evens, odds):
ans.extend([e, o])
if len(evens) > len(odds):
ans.append(evens[-1])
return ans | HumanEval |

Write a Python function which follows this instruction: returns encoded string by cycling groups of three characters. |
def encode_cyclic(s: str):
return encode_cyclic(encode_cyclic(s)) | HumanEval |

Write a Python function which follows this instruction: prime_fib returns n-th number that is a Fibonacci number and it's also prime. |
def prime_fib(n: int):
import math
def is_prime(p):
if p < 2:
return False
for k in range(2, min(int(math.sqrt(p)) + 1, p - 1)):
if p % k == 0:
return False
return True
f = [0, 1]
while True:
f.append(f[-1] + f[-2])
if is_prime(f[-1]):
n -= 1
if n == 0:
return f[-1] | HumanEval |

Write a Python function which follows this instruction: triples_sum_to_zero takes a list of integers as an input. it returns True if there are three distinct elements in the list that sum to zero, and False otherwise. |
def triples_sum_to_zero(l: list):
for i in range(len(l)):
for j in range(i + 1, len(l)):
for k in range(j + 1, len(l)):
if l[i] + l[j] + l[k] == 0:
return True
return False | HumanEval |

Write a Python function which follows this instruction: Imagine a road that's a perfectly straight infinitely long line. n cars are driving left to right; simultaneously, a different set of n cars are driving right to left. The two sets of cars start out being very far from each other. All cars move in the same speed. Two cars are said to collide when a car that's moving left to right hits a car that's moving right to left. However, the cars are infinitely sturdy and strong; as a result, they continue moving in their trajectory as if they did not collide. This function outputs the number of such collisions. |
def car_race_collision(n: int):
return n**2 | HumanEval |

Write a Python function which follows this instruction: Return list with elements incremented by 1. |
def incr_list(l: list):
return [(e + 1) for e in l] | HumanEval |

Write a Python function which follows this instruction: pairs_sum_to_zero takes a list of integers as an input. it returns True if there are two distinct elements in the list that sum to zero, and False otherwise. |
def pairs_sum_to_zero(l):
for i, l1 in enumerate(l):
for j in range(i + 1, len(l)):
if l1 + l[j] == 0:
return True
return False | HumanEval |

Write a Python function which follows this instruction: Change numerical base of input number x to base. return string representation after the conversion. base numbers are less than 10. |
def change_base(x: int, base: int):
ret = ""
while x > 0:
ret = str(x % base) + ret
x //= base
return ret | HumanEval |

Write a Python function which follows this instruction: Given length of a side and high return area for a triangle. |
def triangle_area(a, h):
return a * h / 2.0 | HumanEval |

Write a Python function which follows this instruction: The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows: fib4(0) -> 0 fib4(1) -> 0 fib4(2) -> 2 fib4(3) -> 0 fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4). Please write a function to efficiently compute the n-th element of the fib4 number sequence. Do not use recursion. |
def fib4(n: int):
results = [0, 0, 2, 0]
if n < 4:
return results[n]
for _ in range(4, n + 1):
results.append(results[-1] + results[-2] + results[-3] + results[-4])
results.pop(0)
return results[-1] | HumanEval |

Write a Python function which follows this instruction: Return median of elements in the list l. |
def median(l: list):
l = sorted(l)
if len(l) % 2 == 1:
return l[len(l) // 2]
else:
return (l[len(l) // 2 - 1] + l[len(l) // 2]) / 2.0 | HumanEval |

Write a Python function which follows this instruction: Checks if given string is a palindrome |
def is_palindrome(text: str):
for i in range(len(text)):
if text[i] != text[len(text) - 1 - i]:
return False
return True | HumanEval |

Write a Python function which follows this instruction: Return 2^n modulo p (be aware of numerics). |
def modp(n: int, p: int):
ret = 1
for i in range(n):
ret = (2 * ret) % p
return ret | HumanEval |

Write a Python function which follows this instruction: returns encoded string by shifting every character by 5 in the alphabet. |
def encode_shift(s: str):
return "".join([chr(((ord(ch) - 5 - ord("a")) % 26) + ord("a")) for ch in s]) | HumanEval |

Write a Python function which follows this instruction: remove_vowels is a function that takes string and returns string without vowels. |
def remove_vowels(text):
return "".join([s for s in text if s.lower() not in ["a", "e", "i", "o", "u"]]) | HumanEval |

Write a Python function which follows this instruction: Return True if all numbers in the list l are below threshold t. |
def below_threshold(l: list, t: int):
for e in l:
if e >= t:
return False
return True | HumanEval |

Write a Python function which follows this instruction: Add two numbers x and y |
def add(x: int, y: int):
return x + y | HumanEval |

Write a Python function which follows this instruction: Check if two words have the same characters. |
def same_chars(s0: str, s1: str):
return set(s0) == set(s1) | HumanEval |

Write a Python function which follows this instruction: Return n-th Fibonacci number. |
def fib(n: int):
if n == 0:
return 0
if n == 1:
return 1
return fib(n - 1) + fib(n - 2) | HumanEval |

Write a Python function which follows this instruction: brackets is a string of "<" and ">". return True if every opening bracket has a corresponding closing bracket. |
def correct_bracketing(brackets: str):
depth = 0
for b in brackets:
if b == "<":
depth += 1
else:
depth -= 1
if depth < 0:
return False
return depth == 0 | HumanEval |

Write a Python function which follows this instruction: Return True is list elements are monotonically increasing or decreasing. |
def monotonic(l: list):
if l == sorted(l) or l == sorted(l, reverse=True):
return True
return False | HumanEval |

Write a Python function which follows this instruction: Return sorted unique common elements for two lists. |
def common(l1: list, l2: list):
ret = set()
for e1 in l1:
for e2 in l2:
if e1 == e2:
ret.add(e1)
return sorted(list(ret)) | HumanEval |

Write a Python function which follows this instruction: Return the largest prime factor of n. Assume n > 1 and is not a prime. |
def largest_prime_factor(n: int):
def is_prime(k):
if k < 2:
return False
for i in range(2, k - 1):
if k % i == 0:
return False
return True
largest = 1
for j in range(2, n + 1):
if n % j == 0 and is_prime(j):
largest = max(largest, j)
return largest | HumanEval |

Write a Python function which follows this instruction: sum_to_n is a function that sums numbers from 1 to n. |
def sum_to_n(n: int):
return sum(range(n + 1)) | HumanEval |

Write a Python function which follows this instruction: brackets is a string of "(" and ")". return True if every opening bracket has a corresponding closing bracket. |
def correct_bracketing(brackets: str):
depth = 0
for b in brackets:
if b == "(":
depth += 1
else:
depth -= 1
if depth < 0:
return False
return depth == 0 | HumanEval |

Write a Python function which follows this instruction: xs represent coefficients of a polynomial. xs[0] + xs[1] * x + xs[2] * x^2 + .... Return derivative of this polynomial in the same form. |
def derivative(xs: list):
return [(i * x) for i, x in enumerate(xs)][1:] | HumanEval |

Write a Python function which follows this instruction: The FibFib number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows: fibfib(0) == 0 fibfib(1) == 0 fibfib(2) == 1 fibfib(n) == fibfib(n-1) + fibfib(n-2) + fibfib(n-3). Please write a function to efficiently compute the n-th element of the fibfib number sequence. |
def fibfib(n: int):
if n == 0:
return 0
if n == 1:
return 0
if n == 2:
return 1
return fibfib(n - 1) + fibfib(n - 2) + fibfib(n - 3) | HumanEval |

Write a Python function which follows this instruction: def vowels_count(s): |
FIX = """
Add more test cases.
vowels = "aeiouAEIOU"
n_vowels = sum(c in vowels for c in s)
if s[-1] == 'y' or s[-1] == 'Y':
n_vowels += 1
return n_vowels | HumanEval |

Write a Python function which follows this instruction: Circular shift the digits of the integer x, shift the digits right by shift and return the result as a string. If shift > number of digits, return digits reversed. |
def circular_shift(x, shift):
s = str(x)
if shift > len(s):
return s[::-1]
else:
return s[len(s) - shift:] + s[:len(s) - shift] | HumanEval |

Write a Python function which follows this instruction: Task Write a function that takes a string as input and returns the sum of the upper characters only' ASCII codes. |
def digitSum(s):
if s == "": return 0
return sum(ord(char) if char.isupper() else 0 for char in s) | HumanEval |

Write a Python function which follows this instruction: In this task, you will be given a string that represents a number of apples and oranges that are distributed in a basket of fruit this basket contains apples, oranges, and mango fruits. Given the string that represents the total number of the oranges and apples and an integer that represent the total number of the fruits in the basket return the number of the mango fruits in the basket. |
def fruit_distribution(s,n):
lis = list()
for i in s.split(' '):
if i.isdigit():
lis.append(int(i))
return n - sum(lis) | HumanEval |

Write a Python function which follows this instruction: "Given an array representing a branch of a tree that has non-negative integer nodes your task is to pluck one of the nodes and return it. The plucked node should be the node with the smallest even value. If multiple nodes with the same smallest even value are found return the node that has smallest index. The plucked node should be returned in a list, [ smalest_value, its index ], If there are no even values or the given array is empty, return []. Constraints: * 1 <= nodes.length <= 10000 * 0 <= node.value |
def pluck(arr):
if(len(arr) == 0): return []
evens = list(filter(lambda x: x%2 == 0, arr))
if(evens == []): return []
return [min(evens), arr.index(min(evens))] | HumanEval |

Write a Python function which follows this instruction: You are given a non-empty list of positive integers. Return the greatest integer that is greater than zero, and has a frequency greater than or equal to the value of the integer itself. The frequency of an integer is the number of times it appears in the list. If no such a value exist, return -1. |
def search(lst):
frq = [0] * (max(lst) + 1)
for i in lst:
frq[i] += 1;
ans = -1
for i in range(1, len(frq)):
if frq[i] >= i:
ans = i
return ans | HumanEval |

Write a Python function which follows this instruction: Given list of integers, return list in strange order. Strange sorting, is when you start with the minimum value, then maximum of the remaining integers, then minimum and so on. |
def strange_sort_list(lst):
res, switch = [], True
while lst:
res.append(min(lst) if switch else max(lst))
lst.remove(res[-1])
switch = not switch
return res | HumanEval |

Write a Python function which follows this instruction: Given the lengths of the three sides of a triangle. Return the area of the triangle rounded to 2 decimal points if the three sides form a valid triangle. Otherwise return -1 Three sides make a valid triangle when the sum of any two sides is greater than the third side. |
def triangle_area(a, b, c):
if a + b <= c or a + c <= b or b + c <= a:
return -1
s = (a + b + c)/2
area = (s * (s - a) * (s - b) * (s - c)) ** 0.5
area = round(area, 2)
return area | HumanEval |

Write a Python function which follows this instruction: Write a function that returns True if the object q will fly, and False otherwise. 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. |
def will_it_fly(q,w):
if sum(q) > w:
return False
i, j = 0, len(q)-1
while i<j:
if q[i] != q[j]:
return False
i+=1
j-=1
return True | HumanEval |

Write a Python function which follows this instruction: Given an array arr of integers, find the minimum number of elements that need to be changed to make the array palindromic. A palindromic array is an array that is read the same backwards and forwards. In one change, you can change one element to any other element. |
def smallest_change(arr):
ans = 0
for i in range(len(arr) // 2):
if arr[i] != arr[len(arr) - i - 1]:
ans += 1
return ans | HumanEval |

Write a Python function which follows this instruction: Write a function that accepts two lists of strings and returns the list that has total number of chars in the all strings of the list less than the other list. if the two lists have the same number of chars, return the first list. |
def total_match(lst1, lst2):
l1 = 0
for st in lst1:
l1 += len(st)
l2 = 0
for st in lst2:
l2 += len(st)
if l1 <= l2:
return lst1
else:
return lst2 | HumanEval |

Write a Python function which follows this instruction: Write a function that returns true if the given number is the multiplication of 3 prime numbers and false otherwise. Knowing that (a) is less then 100. |
def is_multiply_prime(a):
def is_prime(n):
for j in range(2,n):
if n%j == 0:
return False
return True
for i in range(2,101):
if not is_prime(i): continue
for j in range(2,101):
if not is_prime(j): continue
for k in range(2,101):
if not is_prime(k): continue
if i*j*k == a: return True
return False | HumanEval |

Write a Python function which follows this instruction: Your task is to write a function that returns true if a number x is a simple power of n and false in other cases. x is a simple power of n if n**int=x |
def is_simple_power(x, n):
if (n == 1):
return (x == 1)
power = 1
while (power < x):
power = power * n
return (power == x) | HumanEval |

Write a Python function which follows this instruction: Write a function that takes an integer a and returns True if this ingeger is a cube of some integer number. Note: you may assume the input is always valid. |
def iscube(a):
a = abs(a)
return int(round(a ** (1. / 3))) ** 3 == a | HumanEval |

Write a Python function which follows this instruction: You have been tasked to write a function that receives a hexadecimal number as a string and counts the number of hexadecimal digits that are primes (prime number, or a prime, is a natural number greater than 1 that is not a product of two smaller natural numbers). Hexadecimal digits are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F. Prime numbers are 2, 3, 5, 7, 11, 13, 17,... So you have to determine a number of the following digits: 2, 3, 5, 7, B (=decimal 11), D (=decimal 13). Note: you may assume the input is always correct or empty string, and symbols A,B,C,D,E,F are always uppercase. |
def hex_key(num):
primes = ('2', '3', '5', '7', 'B', 'D')
total = 0
for i in range(0, len(num)):
if num[i] in primes:
total += 1
return total | HumanEval |

Write a Python function which follows this instruction: You will be given a number in decimal form and your task is to convert it to binary format. The function should return a string, with each character representing a binary number. Each character in the string will be '0' or '1'. There will be an extra couple of characters 'db' at the beginning and at the end of the string. The extra characters are there to help with the format. |
def decimal_to_binary(decimal):
return "db" + bin(decimal)[2:] + "db" | HumanEval |

Write a Python function which follows this instruction: You are given a string s. Your task is to check if the string is happy or not. A string is happy if its length is at least 3 and every 3 consecutive letters are distinct |
def is_happy(s):
if len(s) < 3:
return False
for i in range(len(s) - 2):
if s[i] == s[i+1] or s[i+1] == s[i+2] or s[i] == s[i+2]:
return False
return True | HumanEval |

Write a Python function which follows this instruction: It is the last week of the semester and the teacher has to give the grades to students. The teacher has been making her own algorithm for grading. The only problem is, she has lost the code she used for grading. She has given you a list of GPAs for some students and you have to write a function that can output a list of letter grades using the following table: GPA | Letter grade 4.0 A+ > 3.7 A > 3.3 A- > 3.0 B+ > 2.7 B > 2.3 B- > 2.0 C+ > 1.7 C > 1.3 C- > 1.0 D+ > 0.7 D > 0.0 D- 0.0 E |
def numerical_letter_grade(grades):
letter_grade = []
for gpa in grades:
if gpa == 4.0:
letter_grade.append("A+")
elif gpa > 3.7:
letter_grade.append("A")
elif gpa > 3.3:
letter_grade.append("A-")
elif gpa > 3.0:
letter_grade.append("B+")
elif gpa > 2.7:
letter_grade.append("B")
elif gpa > 2.3:
letter_grade.append("B-")
elif gpa > 2.0:
letter_grade.append("C+")
elif gpa > 1.7:
letter_grade.append("C")
elif gpa > 1.3:
letter_grade.append("C-")
elif gpa > 1.0:
letter_grade.append("D+")
elif gpa > 0.7:
letter_grade.append("D")
elif gpa > 0.0:
letter_grade.append("D-")
else:
letter_grade.append("E")
return letter_grade | HumanEval |

Write a Python function which follows this instruction: Write a function that takes a string and returns True if the string length is a prime number or False otherwise |
def prime_length(string):
l = len(string)
if l == 0 or l == 1:
return False
for i in range(2, l):
if l % i == 0:
return False
return True | HumanEval |

Write a Python function which follows this instruction: Given a positive integer n, return the count of the numbers of n-digit positive integers that start or end with 1. |
def starts_one_ends(n):
if n == 1: return 1
return 18 * (10 ** (n - 2)) | HumanEval |

Write a Python function which follows this instruction: Given a positive integer N, return the total sum of its digits in binary. Variables: @N integer Constraints: 0 ≤ N ≤ 10000. Output: a string of binary number |
def solve(N):
return bin(sum(int(i) for i in str(N)))[2:] | HumanEval |

Write a Python function which follows this instruction: Given a non-empty list of integers lst. add the even elements that are at odd indices.. |
def add(lst):
return sum([lst[i] for i in range(1, len(lst), 2) if lst[i]%2 == 0]) | HumanEval |

Write a Python function which follows this instruction: Write a function that takes a string and returns an ordered version of it. Ordered version of string, is a string where all words (separated by space) are replaced by a new word where all the characters arranged in ascending order based on ascii value. Note: You should keep the order of words and blank spaces in the sentence. |
def anti_shuffle(s):
return ' '.join([''.join(sorted(list(i))) for i in s.split(' ')]) | HumanEval |

Write a Python function which follows this instruction: You are given a 2 dimensional data, as a nested lists, which is similar to matrix, however, unlike matrices, each row may contain a different number of columns. Given lst, and integer x, find integers x in the list, and return list of tuples, [(x1, y1), (x2, y2) ...] such that each tuple is a coordinate - (row, columns), starting with 0. Sort coordinates initially by rows in ascending order. Also, sort coordinates of the row by columns in descending order. |
def get_row(lst, x):
coords = [(i, j) for i in range(len(lst)) for j in range(len(lst[i])) if lst[i][j] == x]
return sorted(sorted(coords, key=lambda x: x[1], reverse=True), key=lambda x: x[0]) | HumanEval |

Write a Python function which follows this instruction: Given an array of non-negative integers, return a copy of the given array after sorting, you will sort the given array in ascending order if the sum( first index value, last index value) is odd, or sort it in descending order if the sum( first index value, last index value) is even. Note: * don't change the given array. |
def sort_array(array):
return [] if len(array) == 0 else sorted(array, reverse= (array[0]+array[-1]) % 2 == 0) | HumanEval |

Write a Python function which follows this instruction: Create a function encrypt that takes a string as an argument and returns a string encrypted with the alphabet being rotated. The alphabet should be rotated in a manner such that the letters shift down by two multiplied to two places. |
def encrypt(s):
d = 'abcdefghijklmnopqrstuvwxyz'
out = ''
for c in s:
if c in d:
out += d[(d.index(c)+2*2) % 26]
else:
out += c
return out | HumanEval |

Write a Python function which follows this instruction: You are given a list of integers. Write a function next_smallest() that returns the 2nd smallest element of the list. Return None if there is no such element. |
def next_smallest(lst):
lst = sorted(set(lst))
return None if len(lst) < 2 else lst[1] | HumanEval |

Write a Python function which follows this instruction: You'll be given a string of words, and your task is to count the number of boredoms. A boredom is a sentence that starts with the word "I". Sentences are delimited by '.', '?' or '!'. |
def is_bored(S):
import re
sentences = re.split(r'[.?!]\s*', S)
return sum(sentence[0:2] == 'I ' for sentence in sentences) | HumanEval |

Write a Python function which follows this instruction: Create a function that takes 3 numbers. Returns true if one of the numbers is equal to the sum of the other two, and all numbers are integers. Returns false in any other cases. |
def any_int(x, y, z):
if isinstance(x,int) and isinstance(y,int) and isinstance(z,int):
if (x+y==z) or (x+z==y) or (y+z==x):
return True
return False
return False | HumanEval |

Write a Python function which follows this instruction: Write a function that takes a message, and encodes in such a way that it swaps case of all letters, replaces all vowels in the message with the letter that appears 2 places ahead of that vowel in the english alphabet. Assume only letters. |
def encode(message):
vowels = "aeiouAEIOU"
vowels_replace = dict([(i, chr(ord(i) + 2)) for i in vowels])
message = message.swapcase()
return ''.join([vowels_replace[i] if i in vowels else i for i in message]) | HumanEval |

Write a Python function which follows this instruction: You are given a list of integers. You need to find the largest prime value and return the sum of its digits. | def skjkasdkd(lst):
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
maxx = 0
i = 0
while i < len(lst):
if(lst[i] > maxx and isPrime(lst[i])):
maxx = lst[i]
i+=1
result = sum(int(digit) for digit in str(maxx))
return result
| HumanEval |

Write a Python function which follows this instruction: Given a dictionary, return True if all keys are strings in lower case or all keys are strings in upper case, else return False. The function should return False is the given dictionary is empty. |
def check_dict_case(dict):
if len(dict.keys()) == 0:
return False
else:
state = "start"
for key in dict.keys():
if isinstance(key, str) == False:
state = "mixed"
break
if state == "start":
if key.isupper():
state = "upper"
elif key.islower():
state = "lower"
else:
break
elif (state == "upper" and not key.isupper()) or (state == "lower" and not key.islower()):
state = "mixed"
break
else:
break
return state == "upper" or state == "lower" | HumanEval |

Write a Python function which follows this instruction: Implement a function that takes an non-negative integer and returns an array of the first n integers that are prime numbers and less than n. | def count_up_to(n):
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
is_prime = False
break
if is_prime:
primes.append(i)
return primes
| HumanEval |

Write a Python function which follows this instruction: Complete the function that takes two integers and returns the product of their unit digits. Assume the input is always valid. |
def multiply(a, b):
return abs(a % 10) * abs(b % 10) | HumanEval |

Write a Python function which follows this instruction: Given a string s, count the number of uppercase vowels in even indices. |
def count_upper(s):
count = 0
for i in range(0,len(s),2):
if s[i] in "AEIOU":
count += 1
return count | HumanEval |

Write a Python function which follows this instruction: Create a function that takes a value (string) representing a number and returns the closest integer to it. If the number is equidistant from two integers, round it away from zero. Note: Rounding away from zero means that if the given number is equidistant from two integers, the one you should return is the one that is the farthest from zero. For example closest_integer("14.5") should return 15 and closest_integer("-14.5") should return -15. | def closest_integer(value):
from math import floor, ceil
if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| HumanEval |