task_id stringlengths 11 13 | prompt stringlengths 615 1.82k | entry_point stringlengths 1 25 | canonical_solution stringlengths 16 864 | tests stringlengths 1.42k 31.7k |
|---|---|---|---|---|
HumanEval/113 | IDENTIFICATION DIVISION.
PROGRAM-ID. ODD-COUNT.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-LST OCCURS 2 TIMES INDEXED BY NI PIC X(2).
05 RESULT OCCURS 100 TIMES INDEXED BY NJ PIC X(1... | odd_count | res = []
for arr in lst:
n = sum(int(d)%2==1 for d in arr)
res.append("the number of odd elements " + str(n) + "n the str"+ str(n) +"ng "+ str(n) +" of the "+ str(n) +"nput.")
return res
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. ODD-COUNT-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "ODD-COUNT.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n ... |
HumanEval/114 | IDENTIFICATION DIVISION.
PROGRAM-ID. MINSUBARRAYSUM.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-NUMS OCCURS 6 TIMES INDEXED BY NI PIC S9(10).
05 RESULT PIC S9(10).
*
* ... | minSubArraySum | max_sum = 0
s = 0
for num in nums:
s += -num
if (s < 0):
s = 0
max_sum = max(s, max_sum)
if max_sum == 0:
max_sum = max(-i for i in nums)
min_sum = -max_sum
return min_sum
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. MINSUBARRAYSUM-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "MINSUBARRAYSUM.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n ... |
HumanEval/116 | IDENTIFICATION DIVISION.
PROGRAM-ID. SORT-ARRAY.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-ARR OCCURS 5 TIMES INDEXED BY NI PIC S9(10).
05 RESULT OCCURS 100 TIMES INDEXED BY NJ PIC ... | sort_array | return sorted(sorted(arr), key=lambda x: bin(x)[2:].count('1'))
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. SORT-ARRAY-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "SORT-ARRAY.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n... |
HumanEval/117 | IDENTIFICATION DIVISION.
PROGRAM-ID. SELECT-WORDS.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-S PIC X(100).
05 L-N PIC S9(10).
05 RESULT OCCURS 100 TIMES INDEXED BY NI PIC... | select_words | result = []
for word in s.split():
n_consonants = 0
for i in range(0, len(word)):
if word[i].lower() not in ["a","e","i","o","u"]:
n_consonants += 1
if n_consonants == n:
result.append(word)
return result
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. SELECT-WORDS-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "SELECT-WORDS.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n ... |
HumanEval/118 | IDENTIFICATION DIVISION.
PROGRAM-ID. GET-CLOSEST-VOWEL.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-WORD PIC X(100).
05 RESULT PIC X(100).
* You are given a word. Your task is ... | get_closest_vowel | if len(word) < 3:
return ""
vowels = {"a", "e", "i", "o", "u", "A", "E", 'O', 'U', 'I'}
for i in range(len(word)-2, 0, -1):
if word[i] in vowels:
if (word[i+1] not in vowels) and (word[i-1] not in vowels):
return word[i]
return ""
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. GET-CLOSEST-VOWEL-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "GET-CLOSEST-VOWEL.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STAT... |
HumanEval/119 | IDENTIFICATION DIVISION.
PROGRAM-ID. MATCH-PARENS.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-LST OCCURS 2 TIMES INDEXED BY NI PIC X(2).
05 RESULT PIC X(100).
* '''
* Yo... | match_parens | def check(s):
val = 0
for i in s:
if i == '(':
val = val + 1
else:
val = val - 1
if val < 0:
return False
return True if val == 0 else False
S1 = lst[0] + lst[1]
S2 = lst[1] + lst[0]
return 'Yes'... | [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. MATCH-PARENS-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "MATCH-PARENS.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n ... |
HumanEval/120 | IDENTIFICATION DIVISION.
PROGRAM-ID. MAXIMUM.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-ARR OCCURS 3 TIMES INDEXED BY NI PIC S9(10).
05 L-K PIC S9(10).
05 RESULT OCCURS 1... | maximum | if k == 0:
return []
arr.sort()
ans = arr[-k:]
return ans
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. MAXIMUM-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "MAXIMUM.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n ... |
HumanEval/121 | IDENTIFICATION DIVISION.
PROGRAM-ID. SOLUTION.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-LST OCCURS 4 TIMES INDEXED BY NI PIC S9(10).
05 RESULT PIC S9(10).
* Given a non-empt... | solution | return sum([x for idx, x in enumerate(lst) if idx%2==0 and x%2==1])
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. SOLUTION-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "SOLUTION.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n ... |
HumanEval/122 | IDENTIFICATION DIVISION.
PROGRAM-ID. ADD-ELEMENTS.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-ARR OCCURS 9 TIMES INDEXED BY NI PIC S9(10).
05 L-K PIC S9(10).
05 RESULT PIC... | add_elements | return sum(elem for elem in arr[:k] if len(str(elem)) <= 2)
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. ADD-ELEMENTS-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "ADD-ELEMENTS.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n ... |
HumanEval/123 | IDENTIFICATION DIVISION.
PROGRAM-ID. GET-ODD-COLLATZ.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-N PIC S9(10).
05 RESULT OCCURS 100 TIMES INDEXED BY NI PIC S9(10).
*
* ... | get_odd_collatz | if n%2==0:
odd_collatz = []
else:
odd_collatz = [n]
while n > 1:
if n % 2 == 0:
n = n/2
else:
n = n*3 + 1
if n%2 == 1:
odd_collatz.append(int(n))
return sorted(odd_collatz)
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. GET-ODD-COLLATZ-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "GET-ODD-COLLATZ.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\... |
HumanEval/124 | IDENTIFICATION DIVISION.
PROGRAM-ID. VALID-DATE.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-DATE PIC X(100).
05 RESULT PIC 9.
* You have to write a function which validates a ... | valid_date | try:
date = date.strip()
month, day, year = date.split('-')
month, day, year = int(month), int(day), int(year)
if month < 1 or month > 12:
return False
if month in [1,3,5,7,8,10,12] and day < 1 or day > 31:
return False
if month in [4,6,9,11] a... | [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. VALID-DATE-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "VALID-DATE.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n... |
HumanEval/126 | IDENTIFICATION DIVISION.
PROGRAM-ID. IS-SORTED.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-LST OCCURS 5 TIMES INDEXED BY NI PIC S9(10).
05 RESULT PIC 9.
* '''
* Given a ... | is_sorted | count_digit = dict([(i, 0) for i in lst])
for i in lst:
count_digit[i]+=1
if any(count_digit[i] > 2 for i in lst):
return False
if all(lst[i-1] <= lst[i] for i in range(1, len(lst))):
return True
else:
return False
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. IS-SORTED-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "IS-SORTED.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n ... |
HumanEval/127 | IDENTIFICATION DIVISION.
PROGRAM-ID. INTERSECTION.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-INTERVAL1 OCCURS 100 TIMES INDEXED BY NI PIC S9(10).
05 L-INTERVAL2 OCCURS 100 TIMES IND... | intersection | def is_prime(num):
if num == 1 or num == 0:
return False
if num == 2:
return True
for i in range(2, num):
if num%i == 0:
return False
return True
l = max(interval1[0], interval2[0])
r = min(interval1[1], interval2[1])
l... | [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. INTERSECTION-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "INTERSECTION.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n ... |
HumanEval/128 | IDENTIFICATION DIVISION.
PROGRAM-ID. PROD-SIGNS.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-ARR OCCURS 4 TIMES INDEXED BY NI PIC S9(10).
05 RESULT PIC S9(10).
*
* You a... | prod_signs | if not arr: return None
prod = 0 if 0 in arr else (-1) ** len(list(filter(lambda x: x < 0, arr)))
return prod * sum([abs(i) for i in arr])
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. PROD-SIGNS-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "PROD-SIGNS.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n... |
HumanEval/130 | IDENTIFICATION DIVISION.
PROGRAM-ID. TRI.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-N PIC S9(10).
05 RESULT OCCURS 100 TIMES INDEXED BY NI PIC S9(10).
* Everyone knows Fibona... | tri | if n == 0:
return [1]
my_tri = [1, 3]
for i in range(2, n + 1):
if i % 2 == 0:
my_tri.append(i / 2 + 1)
else:
my_tri.append(my_tri[i - 1] + my_tri[i - 2] + (i + 3) / 2)
return my_tri
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. TRI-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "TRI.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n DATA DI... |
HumanEval/131 | IDENTIFICATION DIVISION.
PROGRAM-ID. DIGITS.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-N PIC S9(10).
05 RESULT PIC S9(10).
* Given a positive integer n, return the product of... | digits | product = 1
odd_count = 0
for digit in str(n):
int_digit = int(digit)
if int_digit%2 == 1:
product= product*int_digit
odd_count+=1
if odd_count ==0:
return 0
else:
return product
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. DIGITS-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "DIGITS.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n D... |
HumanEval/132 | IDENTIFICATION DIVISION.
PROGRAM-ID. IS-NESTED.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-STRING PIC X(100).
05 RESULT PIC 9.
* '''
* Create a function that takes a str... | is_nested | opening_bracket_index = []
closing_bracket_index = []
for i in range(len(string)):
if string[i] == '[':
opening_bracket_index.append(i)
else:
closing_bracket_index.append(i)
closing_bracket_index.reverse()
cnt = 0
i = 0
l = len(closing_bracket_index)
... | [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. IS-NESTED-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "IS-NESTED.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n ... |
HumanEval/133 | IDENTIFICATION DIVISION.
PROGRAM-ID. SUM-SQUARES.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-LST OCCURS 4 TIMES INDEXED BY NI COMP-2.
05 RESULT PIC S9(10).
* You are given a l... | sum_squares | import math
squared = 0
for i in lst:
squared += math.ceil(i)**2
return squared
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. SUM-SQUARES-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "SUM-SQUARES.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n ... |
HumanEval/134 | IDENTIFICATION DIVISION.
PROGRAM-ID. IS-LAST-CHAR-LETTER.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-TXT PIC X(100).
05 RESULT PIC 9.
* '''
* Create a function that retu... | is_last_char_letter |
check = txt.split(' ')[-1]
return True if len(check) == 1 and (97 <= ord(check.lower()) <= 122) else False
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. IS-LAST-CHAR-LETTER-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "IS-LAST-CHAR-LETTER.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-... |
HumanEval/135 | IDENTIFICATION DIVISION.
PROGRAM-ID. CAN-ARRANGE.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-ARR OCCURS 5 TIMES INDEXED BY NI PIC S9(10).
05 RESULT PIC S9(10).
* Create a func... | can_arrange | ind=-1
i=1
while i<len(arr):
if arr[i]<arr[i-1]:
ind=i
i+=1
return ind
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. CAN-ARRANGE-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "CAN-ARRANGE.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n ... |
HumanEval/138 | IDENTIFICATION DIVISION.
PROGRAM-ID. IS-EQUAL-TO-SUM-EVEN.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-N PIC S9(10).
05 RESULT PIC 9.
* Evaluate whether the given number n can ... | is_equal_to_sum_even | return n%2 == 0 and n >= 8
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. IS-EQUAL-TO-SUM-EVEN-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "IS-EQUAL-TO-SUM-EVEN.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FIL... |
HumanEval/139 | IDENTIFICATION DIVISION.
PROGRAM-ID. SPECIAL-FACTORIAL.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-N PIC S9(10).
05 RESULT PIC S9(10).
* The Brazilian factorial is defined as:... | special_factorial | fact_i = 1
special_fact = 1
for i in range(1, n+1):
fact_i *= i
special_fact *= fact_i
return special_fact
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. SPECIAL-FACTORIAL-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "SPECIAL-FACTORIAL.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STAT... |
HumanEval/140 | IDENTIFICATION DIVISION.
PROGRAM-ID. FIX-SPACES.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-TEXT PIC X(100).
05 RESULT PIC X(100).
*
* Given a string text, replace all ... | fix_spaces | new_text = ""
i = 0
start, end = 0, 0
while i < len(text):
if text[i] == " ":
end += 1
else:
if end - start > 2:
new_text += "-"+text[i]
elif end - start > 0:
new_text += "_"*(end - start)+text[i]
else:
... | [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. FIX-SPACES-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "FIX-SPACES.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n... |
HumanEval/141 | IDENTIFICATION DIVISION.
PROGRAM-ID. FILE-NAME-CHECK.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-FILE-NAME PIC X(100).
05 RESULT PIC X(100).
* Create a function which takes a ... | file_name_check | suf = ['txt', 'exe', 'dll']
lst = file_name.split(sep='.')
if len(lst) != 2:
return 'No'
if not lst[1] in suf:
return 'No'
if len(lst[0]) == 0:
return 'No'
if not lst[0][0].isalpha():
return 'No'
t = len([x for x in lst[0] if x.isdigit()])
if t > 3:
... | [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. FILE-NAME-CHECK-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "FILE-NAME-CHECK.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\... |
HumanEval/142 | IDENTIFICATION DIVISION.
PROGRAM-ID. SUM-SQUARES.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-LST OCCURS 3 TIMES INDEXED BY NI PIC S9(10).
05 RESULT PIC S9(10).
*
* This... | sum_squares | 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)
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. SUM-SQUARES-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "SUM-SQUARES.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n ... |
HumanEval/143 | IDENTIFICATION DIVISION.
PROGRAM-ID. WORDS-IN-SENTENCE.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-SENTENCE PIC X(100).
05 RESULT PIC X(100).
*
* You are given a string... | words_in_sentence | 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)
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. WORDS-IN-SENTENCE-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "WORDS-IN-SENTENCE.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STAT... |
HumanEval/144 | IDENTIFICATION DIVISION.
PROGRAM-ID. SIMPLIFY.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-X PIC X(100).
05 L-N PIC X(100).
05 RESULT PIC 9.
* Your task is to implem... | simplify | 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
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. SIMPLIFY-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "SIMPLIFY.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n ... |
HumanEval/145 | IDENTIFICATION DIVISION.
PROGRAM-ID. ORDER-BY-POINTS.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-NUMS OCCURS 5 TIMES INDEXED BY NI PIC S9(10).
05 RESULT OCCURS 100 TIMES INDEXED BY N... | 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)
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. ORDER-BY-POINTS-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "ORDER-BY-POINTS.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\... |
HumanEval/146 | IDENTIFICATION DIVISION.
PROGRAM-ID. SPECIALFILTER.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-NUMS OCCURS 6 TIMES INDEXED BY NI PIC S9(10).
05 RESULT PIC S9(10).
* Write a fu... | specialFilter |
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
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. SPECIALFILTER-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "SPECIALFILTER.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n ... |
HumanEval/147 | IDENTIFICATION DIVISION.
PROGRAM-ID. GET-MAX-TRIPLES.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-N PIC S9(10).
05 RESULT PIC S9(10).
*
* You are given a positive intege... | get_max_triples | 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)
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. GET-MAX-TRIPLES-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "GET-MAX-TRIPLES.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\... |
HumanEval/148 | IDENTIFICATION DIVISION.
PROGRAM-ID. BF.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-PLANET1 PIC X(100).
05 L-PLANET2 PIC X(100).
05 RESULT OCCURS 100 TIMES INDEXED BY NI P... | bf | 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_ind... | [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. BF-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "BF.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n DATA DIVI... |
HumanEval/149 | IDENTIFICATION DIVISION.
PROGRAM-ID. SORTED-LIST-SUM.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-LST OCCURS 4 TIMES INDEXED BY NI PIC X(4).
05 RESULT OCCURS 100 TIMES INDEXED BY NJ P... | sorted_list_sum | lst.sort()
new_lst = []
for i in lst:
if len(i)%2 == 0:
new_lst.append(i)
return sorted(new_lst, key=len)
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. SORTED-LIST-SUM-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "SORTED-LIST-SUM.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\... |
HumanEval/150 | IDENTIFICATION DIVISION.
PROGRAM-ID. X-OR-Y.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-N PIC S9(10).
05 L-X PIC S9(10).
05 L-Y PIC S9(10).
05 RESULT PIC S9(10)... | x_or_y | if n == 1:
return y
for i in range(2, n):
if n % i == 0:
return y
break
else:
return x
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. X-OR-Y-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "X-OR-Y.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n D... |
HumanEval/151 | IDENTIFICATION DIVISION.
PROGRAM-ID. DOUBLE-THE-DIFFERENCE.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-LST OCCURS 3 TIMES INDEXED BY NI COMP-2.
05 RESULT PIC S9(10).
* '''
... | double_the_difference | return sum([i**2 for i in lst if i > 0 and i%2!=0 and "." not in str(i)])
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. DOUBLE-THE-DIFFERENCE-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "DOUBLE-THE-DIFFERENCE.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-F... |
HumanEval/152 | IDENTIFICATION DIVISION.
PROGRAM-ID. COMPARE.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-GAME OCCURS 6 TIMES INDEXED BY NI PIC S9(10).
05 L-GUESS OCCURS 6 TIMES INDEXED BY NJ PIC S9(... | compare | return [abs(x-y) for x,y in zip(game,guess)]
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. COMPARE-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "COMPARE.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n ... |
HumanEval/153 | IDENTIFICATION DIVISION.
PROGRAM-ID. STRONGEST-EXTENSION.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-CLASS-NAME PIC X(100).
05 L-EXTENSIONS OCCURS 4 TIMES INDEXED BY NI PIC X(4).
... | strongest_extension | 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()])
i... | [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. STRONGEST-EXTENSION-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "STRONGEST-EXTENSION.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-... |
HumanEval/154 | IDENTIFICATION DIVISION.
PROGRAM-ID. CYCPATTERN-CHECK.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-A PIC X(100).
05 L-B PIC X(100).
05 RESULT PIC 9.
* You are given ... | cycpattern_check | 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
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. CYCPATTERN-CHECK-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "CYCPATTERN-CHECK.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS... |
HumanEval/155 | IDENTIFICATION DIVISION.
PROGRAM-ID. EVEN-ODD-COUNT.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-NUM PIC S9(10).
05 RESULT OCCURS 100 TIMES INDEXED BY NI PIC S9(10).
* Given an... | even_odd_count | 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)
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. EVEN-ODD-COUNT-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "EVEN-ODD-COUNT.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n ... |
HumanEval/156 | IDENTIFICATION DIVISION.
PROGRAM-ID. INT-TO-MINI-ROMAN.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-NUMBER PIC S9(10).
05 RESULT PIC X(100).
*
* Given a positive integer... | int_to_mini_roman | 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... | [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. INT-TO-MINI-ROMAN-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "INT-TO-MINI-ROMAN.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STAT... |
HumanEval/157 | IDENTIFICATION DIVISION.
PROGRAM-ID. RIGHT-ANGLE-TRIANGLE.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-A PIC S9(10).
05 L-B PIC S9(10).
05 L-C PIC S9(10).
05 RES... | right_angle_triangle | return a*a == b*b + c*c or b*b == a*a + c*c or c*c == a*a + b*b
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. RIGHT-ANGLE-TRIANGLE-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "RIGHT-ANGLE-TRIANGLE.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FIL... |
HumanEval/158 | IDENTIFICATION DIVISION.
PROGRAM-ID. FIND-MAX.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-WORDS OCCURS 3 TIMES INDEXED BY NI PIC X(3).
05 RESULT PIC X(100).
* Write a function... | find_max | return sorted(words, key = lambda x: (-len(set(x)), x))[0]
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. FIND-MAX-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "FIND-MAX.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n ... |
HumanEval/159 | IDENTIFICATION DIVISION.
PROGRAM-ID. EAT.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-NUMBER PIC S9(10).
05 L-NEED PIC S9(10).
05 L-REMAINING PIC S9(10).
05 RESU... | eat | if(need <= remaining):
return [ number + need , remaining-need ]
else:
return [ number + remaining , 0]
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. EAT-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "EAT.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n DATA DI... |
HumanEval/160 | IDENTIFICATION DIVISION.
PROGRAM-ID. DO-ALGEBRA.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-OPERATOR OCCURS 3 TIMES INDEXED BY NI PIC X(3).
05 L-OPERAND OCCURS 3 TIMES INDEXED BY NJ ... | do_algebra | expression = str(operand[0])
for oprt, oprn in zip(operator, operand[1:]):
expression+= oprt + str(oprn)
return eval(expression)
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. DO-ALGEBRA-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "DO-ALGEBRA.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n... |
HumanEval/161 | IDENTIFICATION DIVISION.
PROGRAM-ID. SOLVE.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-S PIC X(100).
05 RESULT PIC X(100).
* You are given a string s.
* if s[i] is a let... | solve | 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
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. SOLVE-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "SOLVE.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n \n DAT... |
HumanEval/162 | IDENTIFICATION DIVISION.
PROGRAM-ID. STRING-TO-MD5.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-TEXT PIC X(100).
05 RESULT PIC X(100).
*
* Given a string 'text', return ... | string_to_md5 | import hashlib
return hashlib.md5(text.encode('ascii')).hexdigest() if text else None
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. STRING-TO-MD5-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "STRING-TO-MD5.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STATUS.\n ... |
HumanEval/163 | IDENTIFICATION DIVISION.
PROGRAM-ID. GENERATE-INTEGERS.
ENVIRONMENT DIVISION.
INPUT-OUTPUT SECTION.
DATA DIVISION.
LINKAGE SECTION.
01 LINKED-ITEMS.
05 L-A PIC S9(10).
05 L-B PIC S9(10).
05 RESULT OCCURS 100 TIMES INDEXED BY N... | generate_integers | 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]
| [{'test': ' IDENTIFICATION DIVISION.\n PROGRAM-ID. GENERATE-INTEGERS-CALL.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n\n FILE-CONTROL.\n\n SELECT OUTPUT-FILE ASSIGN TO "GENERATE-INTEGERS.TXT"\n ORGANIZATION IS LINE SEQUENTIAL\n STATUS IS OUTPUT-FILE-STAT... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.