task_id
stringlengths 11
13
| prompt
stringlengths 115
1.36k
| canonical_solution
stringlengths 16
864
| test
stringlengths 117
1.8k
| entry_point
stringlengths 1
30
| template_name
stringclasses 2
values | template
stringclasses 2
values | rendered_input
stringlengths 151
2.05k
| rendered_output
stringlengths 1
854
|
|---|---|---|---|---|---|---|---|---|
HumanEval/142
|
def sum_squares(lst):
""""
This function will take a list of integers. For all entries in the list, the function shall square the integer entry if its index is a
multiple of 3 and will cube the integer entry if its index is a multiple of 4 and not a multiple of 3. The function will not
change the entries in the list whose indexes are not a multiple of 3 or 4. The function shall then return the sum of all entries.
Examples:
For lst = [1,2,3] the output should be 6
For lst = [] the output should be 0
For lst = [-1,-5,2,-1,-5] the output should be -126
"""
|
result =[]
for i in range(len(lst)):
if i %3 == 0:
result.append(lst[i]**2)
elif i % 4 == 0 and i%3 != 0:
result.append(lst[i]**3)
else:
result.append(lst[i])
return sum(result)
|
def check(candidate):
# Check some simple cases
assert candidate([1,2,3]) == 6
assert candidate([1,4,9]) == 14
assert candidate([]) == 0
assert candidate([1,1,1,1,1,1,1,1,1]) == 9
assert candidate([-1,-1,-1,-1,-1,-1,-1,-1,-1]) == -3
assert candidate([0]) == 0
assert candidate([-1,-5,2,-1,-5]) == -126
assert candidate([-56,-99,1,0,-2]) == 3030
assert candidate([-1,0,0,0,0,0,0,0,-1]) == 0
assert candidate([-16, -9, -2, 36, 36, 26, -20, 25, -40, 20, -4, 12, -26, 35, 37]) == -14196
assert candidate([-1, -3, 17, -1, -15, 13, -1, 14, -14, -12, -5, 14, -14, 6, 13, 11, 16, 16, 4, 10]) == -1448
# Don't remove this line:
|
sum_squares
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def sum_squares(lst):
""""
This function will take a list of integers. For all entries in the list, the function shall square the integer entry if its index is a
multiple of 3 and will cube the integer entry if its index is a multiple of 4 and not a multiple of 3. The function will not
change the entries in the list whose indexes are not a multiple of 3 or 4. The function shall then return the sum of all entries.
Examples:
For lst = [1,2,3] the output should be 6
For lst = [] the output should be 0
For lst = [-1,-5,2,-1,-5] the output should be -126
"""
result =[]
for i in range(len(lst)):
if i %3 == 0:
result.append(lst[i]**2)
elif i % 4 == 0 and i%3 != 0:
result.append(lst[i]**3)
else:
result.append(lst[i])
return sum(result)
sum_squares([1,2,3]) =
|
6
|
HumanEval/143
|
def words_in_sentence(sentence):
"""
You are given a string representing a sentence,
the sentence contains some words separated by a space,
and you have to return a string that contains the words from the original sentence,
whose lengths are prime numbers,
the order of the words in the new string should be the same as the original one.
Example 1:
Input: sentence = "This is a test"
Output: "is"
Example 2:
Input: sentence = "lets go for swimming"
Output: "go for"
Constraints:
* 1 <= len(sentence) <= 100
* sentence contains only letters
"""
|
new_lst = []
for word in sentence.split():
flg = 0
if len(word) == 1:
flg = 1
for i in range(2, len(word)):
if len(word)%i == 0:
flg = 1
if flg == 0 or len(word) == 2:
new_lst.append(word)
return " ".join(new_lst)
|
def check(candidate):
# Check some simple cases
assert candidate("This is a test") == "is"
assert candidate("lets go for swimming") == "go for"
assert candidate("there is no place available here") == "there is no place"
assert candidate("Hi I am Hussein") == "Hi am Hussein"
assert candidate("go for it") == "go for it"
# Check some edge cases that are easy to work out by hand.
assert candidate("here") == ""
assert candidate("here is") == "is"
|
words_in_sentence
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def words_in_sentence(sentence):
"""
You are given a string representing a sentence,
the sentence contains some words separated by a space,
and you have to return a string that contains the words from the original sentence,
whose lengths are prime numbers,
the order of the words in the new string should be the same as the original one.
Example 1:
Input: sentence = "This is a test"
Output: "is"
Example 2:
Input: sentence = "lets go for swimming"
Output: "go for"
Constraints:
* 1 <= len(sentence) <= 100
* sentence contains only letters
"""
new_lst = []
for word in sentence.split():
flg = 0
if len(word) == 1:
flg = 1
for i in range(2, len(word)):
if len(word)%i == 0:
flg = 1
if flg == 0 or len(word) == 2:
new_lst.append(word)
return " ".join(new_lst)
words_in_sentence("here is") =
|
"is"
|
HumanEval/144
|
def simplify(x, n):
"""Your task is to implement a function that will simplify the expression
x * n. The function returns True if x * n evaluates to a whole number and False
otherwise. Both x and n, are string representation of a fraction, and have the following format,
<numerator>/<denominator> where both numerator and denominator are positive whole numbers.
You can assume that x, and n are valid fractions, and do not have zero as denominator.
simplify("1/5", "5/1") = True
simplify("1/6", "2/1") = False
simplify("7/10", "10/2") = False
"""
|
a, b = x.split("/")
c, d = n.split("/")
numerator = int(a) * int(c)
denom = int(b) * int(d)
if (numerator/denom == int(numerator/denom)):
return True
return False
|
def check(candidate):
# Check some simple cases
assert candidate("1/5", "5/1") == True, 'test1'
assert candidate("1/6", "2/1") == False, 'test2'
assert candidate("5/1", "3/1") == True, 'test3'
assert candidate("7/10", "10/2") == False, 'test4'
assert candidate("2/10", "50/10") == True, 'test5'
assert candidate("7/2", "4/2") == True, 'test6'
assert candidate("11/6", "6/1") == True, 'test7'
assert candidate("2/3", "5/2") == False, 'test8'
assert candidate("5/2", "3/5") == False, 'test9'
assert candidate("2/4", "8/4") == True, 'test10'
# Check some edge cases that are easy to work out by hand.
assert candidate("2/4", "4/2") == True, 'test11'
assert candidate("1/5", "5/1") == True, 'test12'
assert candidate("1/5", "1/5") == False, 'test13'
|
simplify
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def simplify(x, n):
"""Your task is to implement a function that will simplify the expression
x * n. The function returns True if x * n evaluates to a whole number and False
otherwise. Both x and n, are string representation of a fraction, and have the following format,
<numerator>/<denominator> where both numerator and denominator are positive whole numbers.
You can assume that x, and n are valid fractions, and do not have zero as denominator.
simplify("1/5", "5/1") = True
simplify("1/6", "2/1") = False
simplify("7/10", "10/2") = False
"""
a, b = x.split("/")
c, d = n.split("/")
numerator = int(a) * int(c)
denom = int(b) * int(d)
if (numerator/denom == int(numerator/denom)):
return True
return False
simplify("5/2", "3/5") =
|
False, 'test9'
|
HumanEval/145
|
def order_by_points(nums):
"""
Write a function which sorts the given list of integers
in ascending order according to the sum of their digits.
Note: if there are several items with similar sum of their digits,
order them based on their index in original list.
For example:
>>> order_by_points([1, 11, -1, -11, -12]) == [-1, -11, 1, -12, 11]
>>> order_by_points([]) == []
"""
|
def digits_sum(n):
neg = 1
if n < 0: n, neg = -1 * n, -1
n = [int(i) for i in str(n)]
n[0] = n[0] * neg
return sum(n)
return sorted(nums, key=digits_sum)
|
def check(candidate):
# Check some simple cases
assert candidate([1, 11, -1, -11, -12]) == [-1, -11, 1, -12, 11]
assert candidate([1234,423,463,145,2,423,423,53,6,37,3457,3,56,0,46]) == [0, 2, 3, 6, 53, 423, 423, 423, 1234, 145, 37, 46, 56, 463, 3457]
assert candidate([]) == []
assert candidate([1, -11, -32, 43, 54, -98, 2, -3]) == [-3, -32, -98, -11, 1, 2, 43, 54]
assert candidate([1,2,3,4,5,6,7,8,9,10,11]) == [1, 10, 2, 11, 3, 4, 5, 6, 7, 8, 9]
assert candidate([0,6,6,-76,-21,23,4]) == [-76, -21, 0, 4, 23, 6, 6]
# Check some edge cases that are easy to work out by hand.
assert True, "This prints if this assert fails 2 (also good for debugging!)"
|
order_by_points
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def order_by_points(nums):
"""
Write a function which sorts the given list of integers
in ascending order according to the sum of their digits.
Note: if there are several items with similar sum of their digits,
order them based on their index in original list.
For example:
>>> order_by_points([1, 11, -1, -11, -12]) == [-1, -11, 1, -12, 11]
>>> order_by_points([]) == []
"""
def digits_sum(n):
neg = 1
if n < 0: n, neg = -1 * n, -1
n = [int(i) for i in str(n)]
n[0] = n[0] * neg
return sum(n)
return sorted(nums, key=digits_sum)
order_by_points([0,6,6,-76,-21,23,4]) =
|
[-76, -21, 0, 4, 23, 6, 6]
|
HumanEval/146
|
def specialFilter(nums):
"""Write a function that takes an array of numbers as input and returns
the number of elements in the array that are greater than 10 and both
first and last digits of a number are odd (1, 3, 5, 7, 9).
For example:
specialFilter([15, -73, 14, -15]) => 1
specialFilter([33, -2, -3, 45, 21, 109]) => 2
"""
|
count = 0
for num in nums:
if num > 10:
odd_digits = (1, 3, 5, 7, 9)
number_as_string = str(num)
if int(number_as_string[0]) in odd_digits and int(number_as_string[-1]) in odd_digits:
count += 1
return count
|
def check(candidate):
# Check some simple cases
assert candidate([5, -2, 1, -5]) == 0
assert candidate([15, -73, 14, -15]) == 1
assert candidate([33, -2, -3, 45, 21, 109]) == 2
assert candidate([43, -12, 93, 125, 121, 109]) == 4
assert candidate([71, -2, -33, 75, 21, 19]) == 3
# Check some edge cases that are easy to work out by hand.
assert candidate([1]) == 0
assert candidate([]) == 0
|
specialFilter
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def specialFilter(nums):
"""Write a function that takes an array of numbers as input and returns
the number of elements in the array that are greater than 10 and both
first and last digits of a number are odd (1, 3, 5, 7, 9).
For example:
specialFilter([15, -73, 14, -15]) => 1
specialFilter([33, -2, -3, 45, 21, 109]) => 2
"""
count = 0
for num in nums:
if num > 10:
odd_digits = (1, 3, 5, 7, 9)
number_as_string = str(num)
if int(number_as_string[0]) in odd_digits and int(number_as_string[-1]) in odd_digits:
count += 1
return count
specialFilter([43, -12, 93, 125, 121, 109]) =
|
4
|
HumanEval/147
|
def get_max_triples(n):
"""
You are given a positive integer n. You have to create an integer array a of length n.
For each i (1 ≤ i ≤ n), the value of a[i] = i * i - i + 1.
Return the number of triples (a[i], a[j], a[k]) of a where i < j < k,
and a[i] + a[j] + a[k] is a multiple of 3.
Example :
Input: n = 5
Output: 1
Explanation:
a = [1, 3, 7, 13, 21]
The only valid triple is (1, 7, 13).
"""
|
A = [i*i - i + 1 for i in range(1,n+1)]
ans = []
for i in range(n):
for j in range(i+1,n):
for k in range(j+1,n):
if (A[i]+A[j]+A[k])%3 == 0:
ans += [(A[i],A[j],A[k])]
return len(ans)
|
def check(candidate):
assert candidate(5) == 1
assert candidate(6) == 4
assert candidate(10) == 36
assert candidate(100) == 53361
|
get_max_triples
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def get_max_triples(n):
"""
You are given a positive integer n. You have to create an integer array a of length n.
For each i (1 ≤ i ≤ n), the value of a[i] = i * i - i + 1.
Return the number of triples (a[i], a[j], a[k]) of a where i < j < k,
and a[i] + a[j] + a[k] is a multiple of 3.
Example :
Input: n = 5
Output: 1
Explanation:
a = [1, 3, 7, 13, 21]
The only valid triple is (1, 7, 13).
"""
A = [i*i - i + 1 for i in range(1,n+1)]
ans = []
for i in range(n):
for j in range(i+1,n):
for k in range(j+1,n):
if (A[i]+A[j]+A[k])%3 == 0:
ans += [(A[i],A[j],A[k])]
return len(ans)
get_max_triples(100) =
|
53361
|
HumanEval/148
|
def bf(planet1, planet2):
'''
There are eight planets in our solar system: the closerst to the Sun
is Mercury, the next one is Venus, then Earth, Mars, Jupiter, Saturn,
Uranus, Neptune.
Write a function that takes two planet names as strings planet1 and planet2.
The function should return a tuple containing all planets whose orbits are
located between the orbit of planet1 and the orbit of planet2, sorted by
the proximity to the sun.
The function should return an empty tuple if planet1 or planet2
are not correct planet names.
Examples
bf("Jupiter", "Neptune") ==> ("Saturn", "Uranus")
bf("Earth", "Mercury") ==> ("Venus")
bf("Mercury", "Uranus") ==> ("Venus", "Earth", "Mars", "Jupiter", "Saturn")
'''
|
planet_names = ("Mercury", "Venus", "Earth", "Mars", "Jupiter", "Saturn", "Uranus", "Neptune")
if planet1 not in planet_names or planet2 not in planet_names or planet1 == planet2:
return ()
planet1_index = planet_names.index(planet1)
planet2_index = planet_names.index(planet2)
if planet1_index < planet2_index:
return (planet_names[planet1_index + 1: planet2_index])
else:
return (planet_names[planet2_index + 1 : planet1_index])
|
def check(candidate):
# Check some simple cases
assert candidate("Jupiter", "Neptune") == ("Saturn", "Uranus"), "First test error: " + str(len(candidate("Jupiter", "Neptune")))
assert candidate("Earth", "Mercury") == ("Venus",), "Second test error: " + str(candidate("Earth", "Mercury"))
assert candidate("Mercury", "Uranus") == ("Venus", "Earth", "Mars", "Jupiter", "Saturn"), "Third test error: " + str(candidate("Mercury", "Uranus"))
assert candidate("Neptune", "Venus") == ("Earth", "Mars", "Jupiter", "Saturn", "Uranus"), "Fourth test error: " + str(candidate("Neptune", "Venus"))
# Check some edge cases that are easy to work out by hand.
assert candidate("Earth", "Earth") == ()
assert candidate("Mars", "Earth") == ()
assert candidate("Jupiter", "Makemake") == ()
|
bf
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def bf(planet1, planet2):
'''
There are eight planets in our solar system: the closerst to the Sun
is Mercury, the next one is Venus, then Earth, Mars, Jupiter, Saturn,
Uranus, Neptune.
Write a function that takes two planet names as strings planet1 and planet2.
The function should return a tuple containing all planets whose orbits are
located between the orbit of planet1 and the orbit of planet2, sorted by
the proximity to the sun.
The function should return an empty tuple if planet1 or planet2
are not correct planet names.
Examples
bf("Jupiter", "Neptune") ==> ("Saturn", "Uranus")
bf("Earth", "Mercury") ==> ("Venus")
bf("Mercury", "Uranus") ==> ("Venus", "Earth", "Mars", "Jupiter", "Saturn")
'''
planet_names = ("Mercury", "Venus", "Earth", "Mars", "Jupiter", "Saturn", "Uranus", "Neptune")
if planet1 not in planet_names or planet2 not in planet_names or planet1 == planet2:
return ()
planet1_index = planet_names.index(planet1)
planet2_index = planet_names.index(planet2)
if planet1_index < planet2_index:
return (planet_names[planet1_index + 1: planet2_index])
else:
return (planet_names[planet2_index + 1 : planet1_index])
bf("Neptune", "Venus") =
|
("Earth"
|
HumanEval/149
|
def sorted_list_sum(lst):
"""Write a function that accepts a list of strings as a parameter,
deletes the strings that have odd lengths from it,
and returns the resulted list with a sorted order,
The list is always a list of strings and never an array of numbers,
and it may contain duplicates.
The order of the list should be ascending by length of each word, and you
should return the list sorted by that rule.
If two words have the same length, sort the list alphabetically.
The function should return a list of strings in sorted order.
You may assume that all words will have the same length.
For example:
assert list_sort(["aa", "a", "aaa"]) => ["aa"]
assert list_sort(["ab", "a", "aaa", "cd"]) => ["ab", "cd"]
"""
|
lst.sort()
new_lst = []
for i in lst:
if len(i)%2 == 0:
new_lst.append(i)
return sorted(new_lst, key=len)
|
def check(candidate):
# Check some simple cases
assert candidate(["aa", "a", "aaa"]) == ["aa"]
assert candidate(["school", "AI", "asdf", "b"]) == ["AI", "asdf", "school"]
assert candidate(["d", "b", "c", "a"]) == []
assert candidate(["d", "dcba", "abcd", "a"]) == ["abcd", "dcba"]
# Check some edge cases that are easy to work out by hand.
assert candidate(["AI", "ai", "au"]) == ["AI", "ai", "au"]
assert candidate(["a", "b", "b", "c", "c", "a"]) == []
assert candidate(['aaaa', 'bbbb', 'dd', 'cc']) == ["cc", "dd", "aaaa", "bbbb"]
|
sorted_list_sum
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def sorted_list_sum(lst):
"""Write a function that accepts a list of strings as a parameter,
deletes the strings that have odd lengths from it,
and returns the resulted list with a sorted order,
The list is always a list of strings and never an array of numbers,
and it may contain duplicates.
The order of the list should be ascending by length of each word, and you
should return the list sorted by that rule.
If two words have the same length, sort the list alphabetically.
The function should return a list of strings in sorted order.
You may assume that all words will have the same length.
For example:
assert list_sort(["aa", "a", "aaa"]) => ["aa"]
assert list_sort(["ab", "a", "aaa", "cd"]) => ["ab", "cd"]
"""
lst.sort()
new_lst = []
for i in lst:
if len(i)%2 == 0:
new_lst.append(i)
return sorted(new_lst, key=len)
sorted_list_sum(["AI", "ai", "au"]) =
|
["AI"
|
HumanEval/150
|
def x_or_y(n, x, y):
"""A simple program which should return the value of x if n is
a prime number and should return the value of y otherwise.
Examples:
for x_or_y(7, 34, 12) == 34
for x_or_y(15, 8, 5) == 5
"""
|
if n == 1:
return y
for i in range(2, n):
if n % i == 0:
return y
break
else:
return x
|
def check(candidate):
# Check some simple cases
assert candidate(7, 34, 12) == 34
assert candidate(15, 8, 5) == 5
assert candidate(3, 33, 5212) == 33
assert candidate(1259, 3, 52) == 3
assert candidate(7919, -1, 12) == -1
assert candidate(3609, 1245, 583) == 583
assert candidate(91, 56, 129) == 129
assert candidate(6, 34, 1234) == 1234
# Check some edge cases that are easy to work out by hand.
assert candidate(1, 2, 0) == 0
assert candidate(2, 2, 0) == 2
|
x_or_y
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def x_or_y(n, x, y):
"""A simple program which should return the value of x if n is
a prime number and should return the value of y otherwise.
Examples:
for x_or_y(7, 34, 12) == 34
for x_or_y(15, 8, 5) == 5
"""
if n == 1:
return y
for i in range(2, n):
if n % i == 0:
return y
break
else:
return x
x_or_y(1259, 3, 52) =
|
3
|
HumanEval/151
|
def double_the_difference(lst):
'''
Given a list of numbers, return the sum of squares of the numbers
in the list that are odd. Ignore numbers that are negative or not integers.
double_the_difference([1, 3, 2, 0]) == 1 + 9 + 0 + 0 = 10
double_the_difference([-1, -2, 0]) == 0
double_the_difference([9, -2]) == 81
double_the_difference([0]) == 0
If the input list is empty, return 0.
'''
|
return sum([i**2 for i in lst if i > 0 and i%2!=0 and "." not in str(i)])
|
def check(candidate):
# Check some simple cases
assert candidate([]) == 0 , "This prints if this assert fails 1 (good for debugging!)"
assert candidate([5, 4]) == 25 , "This prints if this assert fails 2 (good for debugging!)"
assert candidate([0.1, 0.2, 0.3]) == 0 , "This prints if this assert fails 3 (good for debugging!)"
assert candidate([-10, -20, -30]) == 0 , "This prints if this assert fails 4 (good for debugging!)"
# Check some edge cases that are easy to work out by hand.
assert candidate([-1, -2, 8]) == 0, "This prints if this assert fails 5 (also good for debugging!)"
assert candidate([0.2, 3, 5]) == 34, "This prints if this assert fails 6 (also good for debugging!)"
lst = list(range(-99, 100, 2))
odd_sum = sum([i**2 for i in lst if i%2!=0 and i > 0])
assert candidate(lst) == odd_sum , "This prints if this assert fails 7 (good for debugging!)"
|
double_the_difference
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def double_the_difference(lst):
'''
Given a list of numbers, return the sum of squares of the numbers
in the list that are odd. Ignore numbers that are negative or not integers.
double_the_difference([1, 3, 2, 0]) == 1 + 9 + 0 + 0 = 10
double_the_difference([-1, -2, 0]) == 0
double_the_difference([9, -2]) == 81
double_the_difference([0]) == 0
If the input list is empty, return 0.
'''
return sum([i**2 for i in lst if i > 0 and i%2!=0 and "." not in str(i)])
double_the_difference([5, 4]) =
|
25
|
HumanEval/152
|
def compare(game,guess):
"""I think we all remember that feeling when the result of some long-awaited
event is finally known. The feelings and thoughts you have at that moment are
definitely worth noting down and comparing.
Your task is to determine if a person correctly guessed the results of a number of matches.
You are given two arrays of scores and guesses of equal length, where each index shows a match.
Return an array of the same length denoting how far off each guess was. If they have guessed correctly,
the value is 0, and if not, the value is the absolute difference between the guess and the score.
example:
compare([1,2,3,4,5,1],[1,2,3,4,2,-2]) -> [0,0,0,0,3,3]
compare([0,5,0,0,0,4],[4,1,1,0,0,-2]) -> [4,4,1,0,0,6]
"""
|
return [abs(x-y) for x,y in zip(game,guess)]
|
def check(candidate):
# Check some simple cases
assert candidate([1,2,3,4,5,1],[1,2,3,4,2,-2])==[0,0,0,0,3,3], "This prints if this assert fails 1 (good for debugging!)"
assert candidate([0,0,0,0,0,0],[0,0,0,0,0,0])==[0,0,0,0,0,0], "This prints if this assert fails 1 (good for debugging!)"
assert candidate([1,2,3],[-1,-2,-3])==[2,4,6], "This prints if this assert fails 1 (good for debugging!)"
assert candidate([1,2,3,5],[-1,2,3,4])==[2,0,0,1], "This prints if this assert fails 1 (good for debugging!)"
# Check some edge cases that are easy to work out by hand.
assert True, "This prints if this assert fails 2 (also good for debugging!)"
|
compare
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def compare(game,guess):
"""I think we all remember that feeling when the result of some long-awaited
event is finally known. The feelings and thoughts you have at that moment are
definitely worth noting down and comparing.
Your task is to determine if a person correctly guessed the results of a number of matches.
You are given two arrays of scores and guesses of equal length, where each index shows a match.
Return an array of the same length denoting how far off each guess was. If they have guessed correctly,
the value is 0, and if not, the value is the absolute difference between the guess and the score.
example:
compare([1,2,3,4,5,1],[1,2,3,4,2,-2]) -> [0,0,0,0,3,3]
compare([0,5,0,0,0,4],[4,1,1,0,0,-2]) -> [4,4,1,0,0,6]
"""
return [abs(x-y) for x,y in zip(game,guess)]
compare([1,2,3],[-1,-2,-3]) =
|
[2,4,6]
|
HumanEval/153
|
def Strongest_Extension(class_name, extensions):
"""You will be given the name of a class (a string) and a list of extensions.
The extensions are to be used to load additional classes to the class. The
strength of the extension is as follows: Let CAP be the number of the uppercase
letters in the extension's name, and let SM be the number of lowercase letters
in the extension's name, the strength is given by the fraction CAP - SM.
You should find the strongest extension and return a string in this
format: ClassName.StrongestExtensionName.
If there are two or more extensions with the same strength, you should
choose the one that comes first in the list.
For example, if you are given "Slices" as the class and a list of the
extensions: ['SErviNGSliCes', 'Cheese', 'StuFfed'] then you should
return 'Slices.SErviNGSliCes' since 'SErviNGSliCes' is the strongest extension
(its strength is -1).
Example:
for Strongest_Extension('my_class', ['AA', 'Be', 'CC']) == 'my_class.AA'
"""
|
strong = extensions[0]
my_val = len([x for x in extensions[0] if x.isalpha() and x.isupper()]) - len([x for x in extensions[0] if x.isalpha() and x.islower()])
for s in extensions:
val = len([x for x in s if x.isalpha() and x.isupper()]) - len([x for x in s if x.isalpha() and x.islower()])
if val > my_val:
strong = s
my_val = val
ans = class_name + "." + strong
return ans
|
def check(candidate):
# Check some simple cases
assert candidate('Watashi', ['tEN', 'niNE', 'eIGHt8OKe']) == 'Watashi.eIGHt8OKe'
assert candidate('Boku123', ['nani', 'NazeDa', 'YEs.WeCaNe', '32145tggg']) == 'Boku123.YEs.WeCaNe'
assert candidate('__YESIMHERE', ['t', 'eMptY', 'nothing', 'zeR00', 'NuLl__', '123NoooneB321']) == '__YESIMHERE.NuLl__'
assert candidate('K', ['Ta', 'TAR', 't234An', 'cosSo']) == 'K.TAR'
assert candidate('__HAHA', ['Tab', '123', '781345', '-_-']) == '__HAHA.123'
assert candidate('YameRore', ['HhAas', 'okIWILL123', 'WorkOut', 'Fails', '-_-']) == 'YameRore.okIWILL123'
assert candidate('finNNalLLly', ['Die', 'NowW', 'Wow', 'WoW']) == 'finNNalLLly.WoW'
# Check some edge cases that are easy to work out by hand.
assert candidate('_', ['Bb', '91245']) == '_.Bb'
assert candidate('Sp', ['671235', 'Bb']) == 'Sp.671235'
|
Strongest_Extension
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def Strongest_Extension(class_name, extensions):
"""You will be given the name of a class (a string) and a list of extensions.
The extensions are to be used to load additional classes to the class. The
strength of the extension is as follows: Let CAP be the number of the uppercase
letters in the extension's name, and let SM be the number of lowercase letters
in the extension's name, the strength is given by the fraction CAP - SM.
You should find the strongest extension and return a string in this
format: ClassName.StrongestExtensionName.
If there are two or more extensions with the same strength, you should
choose the one that comes first in the list.
For example, if you are given "Slices" as the class and a list of the
extensions: ['SErviNGSliCes', 'Cheese', 'StuFfed'] then you should
return 'Slices.SErviNGSliCes' since 'SErviNGSliCes' is the strongest extension
(its strength is -1).
Example:
for Strongest_Extension('my_class', ['AA', 'Be', 'CC']) == 'my_class.AA'
"""
strong = extensions[0]
my_val = len([x for x in extensions[0] if x.isalpha() and x.isupper()]) - len([x for x in extensions[0] if x.isalpha() and x.islower()])
for s in extensions:
val = len([x for x in s if x.isalpha() and x.isupper()]) - len([x for x in s if x.isalpha() and x.islower()])
if val > my_val:
strong = s
my_val = val
ans = class_name + "." + strong
return ans
Strongest_Extension('Sp', ['671235', 'Bb']) =
|
'Sp.671235'
|
HumanEval/154
|
def cycpattern_check(a , b):
"""You are given 2 words. You need to return True if the second word or any of its rotations is a substring in the first word
cycpattern_check("abcd","abd") => False
cycpattern_check("hello","ell") => True
cycpattern_check("whassup","psus") => False
cycpattern_check("abab","baa") => True
cycpattern_check("efef","eeff") => False
cycpattern_check("himenss","simen") => True
"""
|
l = len(b)
pat = b + b
for i in range(len(a) - l + 1):
for j in range(l + 1):
if a[i:i+l] == pat[j:j+l]:
return True
return False
|
def check(candidate):
# Check some simple cases
#assert True, "This prints if this assert fails 1 (good for debugging!)"
# Check some edge cases that are easy to work out by hand.
#assert True, "This prints if this assert fails 2 (also good for debugging!)"
assert candidate("xyzw","xyw") == False , "test #0"
assert candidate("yello","ell") == True , "test #1"
assert candidate("whattup","ptut") == False , "test #2"
assert candidate("efef","fee") == True , "test #3"
assert candidate("abab","aabb") == False , "test #4"
assert candidate("winemtt","tinem") == True , "test #5"
|
cycpattern_check
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def cycpattern_check(a , b):
"""You are given 2 words. You need to return True if the second word or any of its rotations is a substring in the first word
cycpattern_check("abcd","abd") => False
cycpattern_check("hello","ell") => True
cycpattern_check("whassup","psus") => False
cycpattern_check("abab","baa") => True
cycpattern_check("efef","eeff") => False
cycpattern_check("himenss","simen") => True
"""
l = len(b)
pat = b + b
for i in range(len(a) - l + 1):
for j in range(l + 1):
if a[i:i+l] == pat[j:j+l]:
return True
return False
cycpattern_check("yello","ell") =
|
True
|
HumanEval/155
|
def even_odd_count(num):
"""Given an integer. return a tuple that has the number of even and odd digits respectively.
Example:
even_odd_count(-12) ==> (1, 1)
even_odd_count(123) ==> (1, 2)
"""
|
even_count = 0
odd_count = 0
for i in str(abs(num)):
if int(i)%2==0:
even_count +=1
else:
odd_count +=1
return (even_count, odd_count)
|
def check(candidate):
# Check some simple cases
assert candidate(7) == (0, 1)
assert candidate(-78) == (1, 1)
assert candidate(3452) == (2, 2)
assert candidate(346211) == (3, 3)
assert candidate(-345821) == (3, 3)
assert candidate(-2) == (1, 0)
assert candidate(-45347) == (2, 3)
assert candidate(0) == (1, 0)
# Check some edge cases that are easy to work out by hand.
assert True
|
even_odd_count
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def even_odd_count(num):
"""Given an integer. return a tuple that has the number of even and odd digits respectively.
Example:
even_odd_count(-12) ==> (1, 1)
even_odd_count(123) ==> (1, 2)
"""
even_count = 0
odd_count = 0
for i in str(abs(num)):
if int(i)%2==0:
even_count +=1
else:
odd_count +=1
return (even_count, odd_count)
even_odd_count(-45347) =
|
(2, 3)
|
HumanEval/156
|
def int_to_mini_roman(number):
"""
Given a positive integer, obtain its roman numeral equivalent as a string,
and return it in lowercase.
Restrictions: 1 <= num <= 1000
Examples:
>>> int_to_mini_roman(19) == 'xix'
>>> int_to_mini_roman(152) == 'clii'
>>> int_to_mini_roman(426) == 'cdxxvi'
"""
|
num = [1, 4, 5, 9, 10, 40, 50, 90,
100, 400, 500, 900, 1000]
sym = ["I", "IV", "V", "IX", "X", "XL",
"L", "XC", "C", "CD", "D", "CM", "M"]
i = 12
res = ''
while number:
div = number // num[i]
number %= num[i]
while div:
res += sym[i]
div -= 1
i -= 1
return res.lower()
|
def check(candidate):
# Check some simple cases
assert candidate(19) == 'xix'
assert candidate(152) == 'clii'
assert candidate(251) == 'ccli'
assert candidate(426) == 'cdxxvi'
assert candidate(500) == 'd'
assert candidate(1) == 'i'
assert candidate(4) == 'iv'
assert candidate(43) == 'xliii'
assert candidate(90) == 'xc'
assert candidate(94) == 'xciv'
assert candidate(532) == 'dxxxii'
assert candidate(900) == 'cm'
assert candidate(994) == 'cmxciv'
assert candidate(1000) == 'm'
# Check some edge cases that are easy to work out by hand.
assert True
|
int_to_mini_roman
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def int_to_mini_roman(number):
"""
Given a positive integer, obtain its roman numeral equivalent as a string,
and return it in lowercase.
Restrictions: 1 <= num <= 1000
Examples:
>>> int_to_mini_roman(19) == 'xix'
>>> int_to_mini_roman(152) == 'clii'
>>> int_to_mini_roman(426) == 'cdxxvi'
"""
num = [1, 4, 5, 9, 10, 40, 50, 90,
100, 400, 500, 900, 1000]
sym = ["I", "IV", "V", "IX", "X", "XL",
"L", "XC", "C", "CD", "D", "CM", "M"]
i = 12
res = ''
while number:
div = number // num[i]
number %= num[i]
while div:
res += sym[i]
div -= 1
i -= 1
return res.lower()
int_to_mini_roman(1000) =
|
'm'
|
HumanEval/157
|
def right_angle_triangle(a, b, c):
'''
Given the lengths of the three sides of a triangle. Return True if the three
sides form a right-angled triangle, False otherwise.
A right-angled triangle is a triangle in which one angle is right angle or
90 degree.
Example:
right_angle_triangle(3, 4, 5) == True
right_angle_triangle(1, 2, 3) == False
'''
|
return a*a == b*b + c*c or b*b == a*a + c*c or c*c == a*a + b*b
|
def check(candidate):
# Check some simple cases
assert candidate(3, 4, 5) == True, "This prints if this assert fails 1 (good for debugging!)"
assert candidate(1, 2, 3) == False
assert candidate(10, 6, 8) == True
assert candidate(2, 2, 2) == False
assert candidate(7, 24, 25) == True
assert candidate(10, 5, 7) == False
assert candidate(5, 12, 13) == True
assert candidate(15, 8, 17) == True
assert candidate(48, 55, 73) == True
# Check some edge cases that are easy to work out by hand.
assert candidate(1, 1, 1) == False, "This prints if this assert fails 2 (also good for debugging!)"
assert candidate(2, 2, 10) == False
|
right_angle_triangle
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def right_angle_triangle(a, b, c):
'''
Given the lengths of the three sides of a triangle. Return True if the three
sides form a right-angled triangle, False otherwise.
A right-angled triangle is a triangle in which one angle is right angle or
90 degree.
Example:
right_angle_triangle(3, 4, 5) == True
right_angle_triangle(1, 2, 3) == False
'''
return a*a == b*b + c*c or b*b == a*a + c*c or c*c == a*a + b*b
right_angle_triangle(2, 2, 10) =
|
False
|
HumanEval/158
|
def find_max(words):
"""Write a function that accepts a list of strings.
The list contains different words. Return the word with maximum number
of unique characters. If multiple strings have maximum number of unique
characters, return the one which comes first in lexicographical order.
find_max(["name", "of", "string"]) == "string"
find_max(["name", "enam", "game"]) == "enam"
find_max(["aaaaaaa", "bb" ,"cc"]) == ""aaaaaaa"
"""
|
return sorted(words, key = lambda x: (-len(set(x)), x))[0]
|
def check(candidate):
# Check some simple cases
assert (candidate(["name", "of", "string"]) == "string"), "t1"
assert (candidate(["name", "enam", "game"]) == "enam"), 't2'
assert (candidate(["aaaaaaa", "bb", "cc"]) == "aaaaaaa"), 't3'
assert (candidate(["abc", "cba"]) == "abc"), 't4'
assert (candidate(["play", "this", "game", "of","footbott"]) == "footbott"), 't5'
assert (candidate(["we", "are", "gonna", "rock"]) == "gonna"), 't6'
assert (candidate(["we", "are", "a", "mad", "nation"]) == "nation"), 't7'
assert (candidate(["this", "is", "a", "prrk"]) == "this"), 't8'
# Check some edge cases that are easy to work out by hand.
assert (candidate(["b"]) == "b"), 't9'
assert (candidate(["play", "play", "play"]) == "play"), 't10'
|
find_max
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def find_max(words):
"""Write a function that accepts a list of strings.
The list contains different words. Return the word with maximum number
of unique characters. If multiple strings have maximum number of unique
characters, return the one which comes first in lexicographical order.
find_max(["name", "of", "string"]) == "string"
find_max(["name", "enam", "game"]) == "enam"
find_max(["aaaaaaa", "bb" ,"cc"]) == ""aaaaaaa"
"""
return sorted(words, key = lambda x: (-len(set(x)), x))[0]
find_max(candidate["play", "this", "game", "of","footbott"]) =
|
"footbott"), 't5'
|
HumanEval/159
|
def eat(number, need, remaining):
"""
You're a hungry rabbit, and you already have eaten a certain number of carrots,
but now you need to eat more carrots to complete the day's meals.
you should return an array of [ total number of eaten carrots after your meals,
the number of carrots left after your meals ]
if there are not enough remaining carrots, you will eat all remaining carrots, but will still be hungry.
Example:
* eat(5, 6, 10) -> [11, 4]
* eat(4, 8, 9) -> [12, 1]
* eat(1, 10, 10) -> [11, 0]
* eat(2, 11, 5) -> [7, 0]
Variables:
@number : integer
the number of carrots that you have eaten.
@need : integer
the number of carrots that you need to eat.
@remaining : integer
the number of remaining carrots thet exist in stock
Constrain:
* 0 <= number <= 1000
* 0 <= need <= 1000
* 0 <= remaining <= 1000
Have fun :)
"""
|
if(need <= remaining):
return [ number + need , remaining-need ]
else:
return [ number + remaining , 0]
|
def check(candidate):
# Check some simple cases
assert True, "This prints if this assert fails 1 (good for debugging!)"
assert candidate(5, 6, 10) == [11, 4], "Error"
assert candidate(4, 8, 9) == [12, 1], "Error"
assert candidate(1, 10, 10) == [11, 0], "Error"
assert candidate(2, 11, 5) == [7, 0], "Error"
# Check some edge cases that are easy to work out by hand.
assert True, "This prints if this assert fails 2 (also good for debugging!)"
assert candidate(4, 5, 7) == [9, 2], "Error"
assert candidate(4, 5, 1) == [5, 0], "Error"
|
eat
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def eat(number, need, remaining):
"""
You're a hungry rabbit, and you already have eaten a certain number of carrots,
but now you need to eat more carrots to complete the day's meals.
you should return an array of [ total number of eaten carrots after your meals,
the number of carrots left after your meals ]
if there are not enough remaining carrots, you will eat all remaining carrots, but will still be hungry.
Example:
* eat(5, 6, 10) -> [11, 4]
* eat(4, 8, 9) -> [12, 1]
* eat(1, 10, 10) -> [11, 0]
* eat(2, 11, 5) -> [7, 0]
Variables:
@number : integer
the number of carrots that you have eaten.
@need : integer
the number of carrots that you need to eat.
@remaining : integer
the number of remaining carrots thet exist in stock
Constrain:
* 0 <= number <= 1000
* 0 <= need <= 1000
* 0 <= remaining <= 1000
Have fun :)
"""
if(need <= remaining):
return [ number + need , remaining-need ]
else:
return [ number + remaining , 0]
eat(2, 11, 5) =
|
[7, 0]
|
HumanEval/160
|
def do_algebra(operator, operand):
"""
Given two lists operator, and operand. The first list has basic algebra operations, and
the second list is a list of integers. Use the two given lists to build the algebric
expression and return the evaluation of this expression.
The basic algebra operations:
Addition ( + )
Subtraction ( - )
Multiplication ( * )
Floor division ( // )
Exponentiation ( ** )
Example:
operator['+', '*', '-']
array = [2, 3, 4, 5]
result = 2 + 3 * 4 - 5
=> result = 9
Note:
The length of operator list is equal to the length of operand list minus one.
Operand is a list of of non-negative integers.
Operator list has at least one operator, and operand list has at least two operands.
"""
|
expression = str(operand[0])
for oprt, oprn in zip(operator, operand[1:]):
expression+= oprt + str(oprn)
return eval(expression)
|
def check(candidate):
# Check some simple cases
assert candidate(['**', '*', '+'], [2, 3, 4, 5]) == 37
assert candidate(['+', '*', '-'], [2, 3, 4, 5]) == 9
assert candidate(['//', '*'], [7, 3, 4]) == 8, "This prints if this assert fails 1 (good for debugging!)"
# Check some edge cases that are easy to work out by hand.
assert True, "This prints if this assert fails 2 (also good for debugging!)"
|
do_algebra
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def do_algebra(operator, operand):
"""
Given two lists operator, and operand. The first list has basic algebra operations, and
the second list is a list of integers. Use the two given lists to build the algebric
expression and return the evaluation of this expression.
The basic algebra operations:
Addition ( + )
Subtraction ( - )
Multiplication ( * )
Floor division ( // )
Exponentiation ( ** )
Example:
operator['+', '*', '-']
array = [2, 3, 4, 5]
result = 2 + 3 * 4 - 5
=> result = 9
Note:
The length of operator list is equal to the length of operand list minus one.
Operand is a list of of non-negative integers.
Operator list has at least one operator, and operand list has at least two operands.
"""
expression = str(operand[0])
for oprt, oprn in zip(operator, operand[1:]):
expression+= oprt + str(oprn)
return eval(expression)
do_algebra(['+', '*', '-'], [2, 3, 4, 5]) =
|
9
|
HumanEval/161
|
def solve(s):
"""You are given a string s.
if s[i] is a letter, reverse its case from lower to upper or vise versa,
otherwise keep it as it is.
If the string contains no letters, reverse the string.
The function should return the resulted string.
Examples
solve("1234") = "4321"
solve("ab") = "AB"
solve("#a@C") = "#A@c"
"""
|
flg = 0
idx = 0
new_str = list(s)
for i in s:
if i.isalpha():
new_str[idx] = i.swapcase()
flg = 1
idx += 1
s = ""
for i in new_str:
s += i
if flg == 0:
return s[len(s)::-1]
return s
|
def check(candidate):
# Check some simple cases
assert candidate("AsDf") == "aSdF"
assert candidate("1234") == "4321"
assert candidate("ab") == "AB"
assert candidate("#a@C") == "#A@c"
assert candidate("#AsdfW^45") == "#aSDFw^45"
assert candidate("#6@2") == "2@6#"
# Check some edge cases that are easy to work out by hand.
assert candidate("#$a^D") == "#$A^d"
assert candidate("#ccc") == "#CCC"
# Don't remove this line:
|
solve
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def solve(s):
"""You are given a string s.
if s[i] is a letter, reverse its case from lower to upper or vise versa,
otherwise keep it as it is.
If the string contains no letters, reverse the string.
The function should return the resulted string.
Examples
solve("1234") = "4321"
solve("ab") = "AB"
solve("#a@C") = "#A@c"
"""
flg = 0
idx = 0
new_str = list(s)
for i in s:
if i.isalpha():
new_str[idx] = i.swapcase()
flg = 1
idx += 1
s = ""
for i in new_str:
s += i
if flg == 0:
return s[len(s)::-1]
return s
solve("#ccc") =
|
"#CCC"
|
HumanEval/162
|
def string_to_md5(text):
"""
Given a string 'text', return its md5 hash equivalent string.
If 'text' is an empty string, return None.
>>> string_to_md5('Hello world') == '3e25960a79dbc69b674cd4ec67a72c62'
"""
|
import hashlib
return hashlib.md5(text.encode('ascii')).hexdigest() if text else None
|
def check(candidate):
# Check some simple cases
assert candidate('Hello world') == '3e25960a79dbc69b674cd4ec67a72c62'
assert candidate('') == None
assert candidate('A B C') == '0ef78513b0cb8cef12743f5aeb35f888'
assert candidate('password') == '5f4dcc3b5aa765d61d8327deb882cf99'
# Check some edge cases that are easy to work out by hand.
assert True
|
string_to_md5
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def string_to_md5(text):
"""
Given a string 'text', return its md5 hash equivalent string.
If 'text' is an empty string, return None.
>>> string_to_md5('Hello world') == '3e25960a79dbc69b674cd4ec67a72c62'
"""
import hashlib
return hashlib.md5(text.encode('ascii')).hexdigest() if text else None
string_to_md5('Hello world') =
|
'3e25960a79dbc69b674cd4ec67a72c62'
|
HumanEval/163
|
def generate_integers(a, b):
"""
Given two positive integers a and b, return the even digits between a
and b, in ascending order.
For example:
generate_integers(2, 8) => [2, 4, 6, 8]
generate_integers(8, 2) => [2, 4, 6, 8]
generate_integers(10, 14) => []
"""
|
lower = max(2, min(a, b))
upper = min(8, max(a, b))
return [i for i in range(lower, upper+1) if i % 2 == 0]
|
def check(candidate):
# Check some simple cases
assert candidate(2, 10) == [2, 4, 6, 8], "Test 1"
assert candidate(10, 2) == [2, 4, 6, 8], "Test 2"
assert candidate(132, 2) == [2, 4, 6, 8], "Test 3"
assert candidate(17,89) == [], "Test 4"
# Check some edge cases that are easy to work out by hand.
assert True, "This prints if this assert fails 2 (also good for debugging!)"
|
generate_integers
|
function call return value generation
|
{% set ns = namespace(tests=[])%}
{% set lines = test.split('\n') %}
{% set test_ = "" %}
{% set args = "" %}
{% set return_val = "" %}
{% for line in lines %}
{% if line.strip().startswith('assert') and "==" in line.strip() %}
{% set ns.tests = ns.tests + [line.split('assert')[1]] %}
{% endif %}
{% endfor %}
{% if (ns.tests | length) > 0 %}
{% set test_ = ns.tests | choice %}
{% set return_val = test_.split("==")[1].split(", \"")[0].strip() %}
{% set args = (test_.split('(')[1:] | join("")).split("==")[0].strip() %}
{{ prompt }}
{{ canonical_solution }}
{{entry_point}}({{args}} =
|||
{{ return_val }}
{% endif %}
|
def generate_integers(a, b):
"""
Given two positive integers a and b, return the even digits between a
and b, in ascending order.
For example:
generate_integers(2, 8) => [2, 4, 6, 8]
generate_integers(8, 2) => [2, 4, 6, 8]
generate_integers(10, 14) => []
"""
lower = max(2, min(a, b))
upper = min(8, max(a, b))
return [i for i in range(lower, upper+1) if i % 2 == 0]
generate_integers(10, 2) =
|
[2, 4, 6, 8]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.