eval_before_after_full_code.csv

phase,bench,task_id,entry_point,pass,error,seconds,tokens,code
after_lora,HumanEval,HumanEval/90,next_smallest,False,"Traceback (most recent call last):
  File ""/tmp/tmpjtrzhjnx.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 7, in check
AssertionError
",8.344,71,"def next_smallest(lst):
    if len(lst) < 2:
        return None
    a = b = float('inf')
    for x in lst:
        if x < a:
            b = a
            a = x
        elif x < b:
            b = x
    return b"
after_lora,HumanEval,HumanEval/91,is_bored,False,"Traceback (most recent call last):
  File ""/tmp/tmpog218alo.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 9, in check
AssertionError: Test 6
",4.642,39,"def is_bored(S):
    count = 0
    for word in S.split():
        if word == ""I"":
            count += 1
    return count"
after_lora,HumanEval,HumanEval/92,any_int,True,,6.286,54,"def any_int(x, y, z):
    if not all(isinstance(i, int) for i in (x, y, z)):
        return False
    return x + y == z or x + z == y or y + z == x"
after_lora,HumanEval,HumanEval/93,encode,False,"Traceback (most recent call last):
  File ""/tmp/tmp4m3wzacl.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 4, in check
AssertionError: This prints if this assert fails 1 (good for debugging!)
",11.405,99,"def encode(message):
    vowels = 'aeiou'
    result = []
    for ch in message:
        if ch.isalpha():
            if ch.lower() in vowels:
                result.append(chr(ord('A') + (ord(ch.upper()) - ord('A') + 2) % 26))
            else:
                result.append(ch.swapcase())
        else:
            result.append(ch)
    return ''.join(result)"
after_lora,HumanEval,HumanEval/94,skjkasdkd,False,"syntax error: unindent does not match any outer indentation level (<unknown>, line 22)",17.243,149,"def skjkasdkd(lst):
    """"""You are given a list of integers.
    You need to find the largest prime value and return the sum of its digits.

    Examples:
    For lst = [0,3,2,1,3,5,7,4,5,5,5,2,181,32,4,32,3,2,32,324,4,3] the output should be 10
    For lst = [1,0,1,8,2,4597,2,1,3,40,1,2,1,2,4,2,5,1] the output should be 25
    For lst = [1,3,1,32,5107,34,83278,109,163,23,2323,32,30,1,9,3] the output should be 13
    For lst = [0,724,32,71,99,32,6,0,5,91,83,0,5,6] the output should be 11
    For lst = [0,81,12,3,1,21] the output should be 3
    For lst = [0,8,1,2,1,7] the output should be 7
    """"""
    def is_prime(n):
            if n < 2: return False
            if n == 2 or n == 3: return True
            if n % 2 == 0: return False
            d = 3
            while d * d <= n:
                if n % d == 0: return False
                d += 2
            return True
        best = 0
        for x in lst:
            if is_prime(x) and x > best: best = x
        if best == 0: return 0
        s = str(best)
        return sum(int(ch) for ch in s)"
after_lora,HumanEval,HumanEval/95,check_dict_case,False,"Traceback (most recent call last):
  File ""/tmp/tmp79ee_0vd.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 5, in check
AssertionError: Second test error: True
",7.395,63,"def check_dict_case(dict):
    if not dict:
        return False
    first_key = next(iter(dict))
    if isinstance(first_key, str):
        return all(isinstance(key, str) and key.islower() or key.isupper() for key in dict)
    return False"
after_lora,HumanEval,HumanEval/96,count_up_to,False,"Traceback (most recent call last):
  File ""/tmp/tmpn2n_d2ob.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 3, in check
AssertionError
",12.294,106,"def count_up_to(n):
    if n <= 1:
        return []
    primes = []
    candidate = 2
    while len(primes) < n:
        is_prime = True
        for p in primes:
            if p * p > candidate:
                break
            if candidate % p == 0:
                is_prime = False
                break
        if is_prime:
            primes.append(candidate)
        candidate += 1
    return primes"
after_lora,HumanEval,HumanEval/97,multiply,True,,3.118,25,"def multiply(a, b):
    return (a % 10) * (b % 10)"
after_lora,HumanEval,HumanEval/98,count_upper,True,,6.485,56,"def count_upper(s):
    vowels = 'AEIOU'
    count = 0
    for i, ch in enumerate(s):
        if i % 2 == 0 and ch in vowels:
            count += 1
    return count"
after_lora,HumanEval,HumanEval/99,closest_integer,True,,5.579,47,"def closest_integer(value):
    value = float(value)
    if value >= 0:
        return int(value + 0.5)
    else:
        return int(value - 0.5)"
after_lora,HumanEval,HumanEval/100,make_a_pile,False,"Traceback (most recent call last):
  File ""/tmp/tmpt152hhwb.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 4, in check
AssertionError: Test 3
",7.865,68,"def make_a_pile(n):
    levels = [n]
    current = n
    for _ in range(n - 1):
        if current % 2 == 0:
            current += 2
        else:
            current += 1
        levels.append(current)
    return levels"
after_lora,HumanEval,HumanEval/101,words_string,False,"Traceback (most recent call last):
  File ""/tmp/tmpyylwdipv.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 5, in check
AssertionError
",2.872,23,"def words_string(s):
    return [word.strip() for word in s.split(',') if word.strip()]"
after_lora,HumanEval,HumanEval/102,choose_num,False,"Traceback (most recent call last):
  File ""/tmp/tmplh6mpo8h.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 4, in check
AssertionError
",6.313,55,"def choose_num(x, y):
    if x > y:
        return -1
    if x % 2 == 0:
        return x
    if y % 2 == 0:
        return y
    return -1"
after_lora,HumanEval,HumanEval/103,rounded_avg,False,"Traceback (most recent call last):
  File ""/tmp/tmpcaced0ua.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 4, in check
AssertionError
",8.194,71,"def rounded_avg(n, m):
    if n > m:
        return -1
    total = (n + m) * (m - n + 1) // 2
    avg = total / (m - n + 1)
    rounded = round(avg)
    return bin(rounded)[2:]"
after_lora,HumanEval,HumanEval/104,unique_digits,False,"syntax error: unindent does not match any outer indentation level (<unknown>, line 18)",7.081,60,"def unique_digits(x):
    """"""Given a list of positive integers x. return a sorted list of all 
    elements that hasn't any even digit.

    Note: Returned list should be sorted in increasing order.
    
    For example:
    >>> unique_digits([15, 33, 1422, 1])
    [1, 15, 33]
    >>> unique_digits([152, 323, 1422, 10])
    []
    """"""
    def has_even_digit(n):
            for ch in str(n):
                if int(ch) % 2 == 0:
                    return True
            return False
        return sorted([n for n in x if not has_even_digit(n)])"
after_lora,HumanEval,HumanEval/105,by_length,True,,9.274,79,"def by_length(arr):
    names = [""One"", ""Two"", ""Three"", ""Four"", ""Five"", ""Six"", ""Seven"", ""Eight"", ""Nine""]
    filtered = sorted([x for x in arr if 1 <= x <= 9])
    filtered.reverse()
    return [names[int(x) - 1] for x in filtered]"
after_lora,HumanEval,HumanEval/106,f,False,"Traceback (most recent call last):
  File ""/tmp/tmpm9rxffb_.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 3, in check
AssertionError
",10.015,87,"def f(n):
    result = []
    fact = 1
    for i in range(1, n+1):
        if i % 2 == 0:
            result.append(fact)
        else:
            result.append(i * (i + 1) // 2)
        if i % 2 == 0:
            fact *= i
    return result"
after_lora,HumanEval,HumanEval/107,even_odd_palindrome,True,,10.389,89,"def even_odd_palindrome(n):
    count_even = 0
    count_odd = 0
    for i in range(1, n + 1):
        s = str(i)
        if s == s[::-1]:
            if i % 2 == 0:
                count_even += 1
            else:
                count_odd += 1
    return count_even, count_odd"
after_lora,HumanEval,HumanEval/108,count_nums,False,"Traceback (most recent call last):
  File ""/tmp/tmpul85f0ct.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 5, in check
AssertionError
",3.504,29,"def count_nums(arr):
    return sum(sum(int(d) for d in str(abs(x))) > 0 for x in arr)"
after_lora,HumanEval,HumanEval/109,move_one_ball,False,"Traceback (most recent call last):
  File ""/tmp/tmpnbdza6sc.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 4, in check
AssertionError: This prints if this assert fails 1 (good for debugging!)
",6.845,57,"def move_one_ball(arr):
    if not arr:
        return True
    sorted_arr = sorted(arr)
    if sorted_arr == arr:
        return True
    rotated = arr[-1:] + arr[:-1]
    return rotated == sorted_arr"
after_lora,HumanEval,HumanEval/110,exchange,True,,7.978,68,"def exchange(lst1, lst2):
    odd_in_lst1 = sum(x % 2 for x in lst1)
    even_in_lst2 = sum(x % 2 == 0 for x in lst2)
    return ""YES"" if even_in_lst2 >= odd_in_lst1 else ""NO"""
after_lora,HumanEval,HumanEval/111,histogram,False,"Traceback (most recent call last):
  File ""/tmp/tmpz21hynfp.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 13, in check
  File ""<string>"", line 5, in histogram
ValueError: max() iterable argument is empty
",7.488,65,"def histogram(test):
    counts = {}
    for ch in test.split():
        counts[ch] = counts.get(ch, 0) + 1
    max_count = max(counts.values())
    return {ch: count for ch, count in counts.items() if count == max_count}"
after_lora,HumanEval,HumanEval/112,reverse_delete,False,"Traceback (most recent call last):
  File ""/tmp/tmpudyw4dog.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 3, in check
AssertionError
",4.199,35,"def reverse_delete(s,c):
    for ch in c:
        s = s.replace(ch,'')
    return s,len(s)==len(s[::-1])"
after_lora,HumanEval,HumanEval/113,odd_count,True,,8.258,72,"def odd_count(lst):
    out = []
    for i, s in enumerate(lst):
        n = sum(int(ch) % 2 for ch in s)
        out.append(f""the number of odd elements {n}n the str{n}ng {n} of the {n}nput."")
    return out"
after_lora,HumanEval,HumanEval/114,minSubArraySum,True,,6.627,58,"def minSubArraySum(nums):
    cur = nums[0]
    best = nums[0]
    for x in nums[1:]:
        cur = min(x, cur + x)
        best = min(best, cur)
    return best"
after_lora,HumanEval,HumanEval/115,max_fill,False,"syntax error: unexpected indent (<unknown>, line 37)",4.423,36,"def max_fill(grid, capacity):
    import math
    """"""
    You are given a rectangular grid of wells. Each row represents a single well,
    and each 1 in a row represents a single unit of water.
    Each well has a corresponding bucket that can be used to extract water from it, 
    and all buckets have the same capacity.
    Your task is to use the buckets to empty the wells.
    Output the number of times you need to lower the buckets.

    Example 1:
        Input: 
            grid : [[0,0,1,0], [0,1,0,0], [1,1,1,1]]
            bucket_capacity : 1
        Output: 6

    Example 2:
        Input: 
            grid : [[0,0,1,1], [0,0,0,0], [1,1,1,1], [0,1,1,1]]
            bucket_capacity : 2
        Output: 5
    
    Example 3:
        Input: 
            grid : [[0,0,0], [0,0,0]]
            bucket_capacity : 5
        Output: 0

    Constraints:
        * all wells have the same length
        * 1 <= grid.length <= 10^2
        * 1 <= grid[:,1].length <= 10^2
        * grid[i][j] -> 0 | 1
        * 1 <= capacity <= 10
    """"""
    import math
        total = sum(row.count(1) for row in grid)
        return math.ceil(total / capacity)"
after_lora,HumanEval,HumanEval/116,sort_array,True,,3.216,26,"def sort_array(arr):
    return sorted(arr, key=lambda x: (bin(x).count('1'), x))"
after_lora,HumanEval,HumanEval/117,select_words,True,,9.958,86,"def select_words(s, n):
    consonants = set('bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ')
    words = s.strip().split()
    result = []
    for word in words:
        count = sum(ch in consonants for ch in word)
        if count == n:
            result.append(word)
    return result"
after_lora,HumanEval,HumanEval/118,get_closest_vowel,False,"Traceback (most recent call last):
  File ""/tmp/tmp0mvdraqw.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 4, in check
AssertionError
",8.857,76,"def get_closest_vowel(word):
    vowels = set('aeiouAEIOU')
    for i in range(1, len(word) - 1):
        if word[i] in vowels and word[i - 1] not in vowels and word[i + 1] not in vowels:
            return word[i]
    return ''"
after_lora,HumanEval,HumanEval/119,match_parens,False,"Traceback (most recent call last):
  File ""/tmp/tmplvnvmewd.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 4, in check
AssertionError
",10.075,87,"def match_parens(lst):
    a, b = lst
    if a == b:
        return 'No'
    if a == '()' and b == '()':
        return 'Yes'
    if a == '(' and b == ')':
        return 'Yes'
    if a == ')' and b == '(':
        return 'Yes'
    return 'No'"
after_lora,HumanEval,HumanEval/120,maximum,False,"Traceback (most recent call last):
  File ""/tmp/tmptt1uc3og.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 4, in check
AssertionError
",2.395,18,"def maximum(arr, k):
    return sorted(arr, reverse=True)[:k]"
after_lora,HumanEval,HumanEval/121,solution,True,,5.828,49,"def solution(lst):
    total = 0
    for i, value in enumerate(lst):
        if i % 2 == 0 and value % 2 != 0:
            total += value
    return total"
after_lora,HumanEval,HumanEval/122,add_elements,True,,5.28,45,"def add_elements(arr, k):
    total = 0
    for i in range(k):
        if abs(arr[i]) <= 99:
            total += arr[i]
    return total"
after_lora,HumanEval,HumanEval/123,get_odd_collatz,True,,9.024,77,"def get_odd_collatz(n):
    seen = set()
    path = []
    while n not in seen:
        seen.add(n)
        path.append(n)
        n = (n * 3 + 1) if n % 2 else n // 2
    return sorted(x for x in path if x % 2)"
after_lora,HumanEval,HumanEval/124,valid_date,True,,25.971,228,"def valid_date(date):
    parts = date.split('-')
    if len(parts) != 3:
        return False
    month, day, year = parts
    if not month.isdigit() or not day.isdigit() or not year.isdigit():
        return False
    month = int(month)
    day = int(day)
    year = int(year)
    if month < 1 or month > 12:
        return False
    if year < 1900 or year > 2100:
        return False
    if month in (1, 3, 5, 7, 8, 10, 12):
        if day < 1 or day > 31:
            return False
    elif month in (4, 6, 9, 11):
        if day < 1 or day > 30:
            return False
    else:
        if day < 1 or day > 29:
            return False
    return True"
after_lora,HumanEval,HumanEval/125,split_words,False,"Traceback (most recent call last):
  File ""/tmp/tmpc4tph2f5.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 8, in check
AssertionError
",5.856,50,"def split_words(txt):
    if ' ' in txt:
        return txt.split(' ')
    if ',' in txt:
        return txt.split(',')
    return sum(ord(c) % 2 for c in txt.lower())"
after_lora,HumanEval,HumanEval/126,is_sorted,False,"Traceback (most recent call last):
  File ""/tmp/tmp6asj9t8f.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 17, in check
AssertionError: This prints if this assert fails 7 (good for debugging!)
",6.963,59,"def is_sorted(lst):
    prev = None
    for x in lst:
        if prev is not None and x < prev:
            return False
        if prev is not None and x == prev:
            return False
        prev = x
    return True"
after_lora,HumanEval,HumanEval/127,intersection,False,"Traceback (most recent call last):
  File ""/tmp/tmpe5d_1k8u.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 5, in check
AssertionError
",13.746,119,"def intersection(interval1, interval2):
    start = max(interval1[0], interval2[0])
    end = min(interval1[1], interval2[1])
    if start > end:
        return ""NO""
    length = end - start + 1
    if length < 2:
        return ""NO""
    for i in range(2, int(length ** 0.5) + 1):
        if length % i == 0:
            return ""NO""
    return ""YES"""
after_lora,HumanEval,HumanEval/128,prod_signs,True,,7.681,67,"def prod_signs(arr):
    if not arr:
        return None
    sign = 1
    for x in arr:
        if x == 0:
            return 0
        sign *= int(x / abs(x))
    return sum(abs(x) for x in arr) * sign"
after_lora,HumanEval,HumanEval/129,minPath,False,"Traceback (most recent call last):
  File ""/tmp/tmpylo6w9cm.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 6, in check
AssertionError
",21.035,184,"def minPath(grid, k):
    n = len(grid)
    start = (0, 0)
    cur = [grid[start[0]][start[1]]]
    for _ in range(k - 1):
        best = None
        for dx, dy in ((-1, 0), (1, 0), (0, -1), (0, 1)):
            nx, ny = start[0] + dx, start[1] + dy
            if 0 <= nx < n and 0 <= ny < n:
                cand = cur[:]
                cand.append(grid[nx][ny])
                if best is None or cand < best:
                    best = cand
        start = (start[0] + dx, start[1] + dy)
        cur = best
    return cur"
after_lora,MBPP,MBPP/101,kth_element,False,"Traceback (most recent call last):
  File ""/tmp/tmpn2zf8npm.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",4.427,37,"def kth_element(arr, k, target):
    for i in range(k):
        if arr[i] == target:
            return i
    return -1"
after_lora,MBPP,MBPP/102,snake_to_camel,True,,5.802,50,"def snake_to_camel(s):
    if not s:
        return ''
    parts = s.lower().split('_')
    return parts[0].capitalize() + ''.join(part.capitalize() for part in parts[1:])"
after_lora,MBPP,MBPP/103,eulerian_num,False,"Traceback (most recent call last):
  File ""/tmp/tmp3mwm1gc9.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",43.238,384,"def eulerian_num(n, m):
    if m == 0: return 1
    if m == 1: return 2
    if m == 2: return 3
    if m == 3: return 4
    if m == 4: return 11
    if m == 5: return 26
    if m == 6: return 87
    if m == 7: return 274
    if m == 8: return 877
    if m == 9: return 2885
    if m == 10: return 9896
    if m == 11: return 34465
    if m == 12: return 124160
    if m == 13: return 441064
    if m == 14: return 1646719
    if m == 15: return 6148892
    if m == 16: return 23293785
    if m == 17: return 87813196
    if m == 18: return 335303681
    if m == 19: return 1280302404
    if m == 20: return 4918030081
    if m == 21: return 18744120324
    if m == 22: return 72176481289
    if m == 23: return"
after_lora,MBPP,MBPP/104,sort_sublists,False,"Traceback (most recent call last):
  File ""/tmp/tmpmqp8p1kx.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",2.959,24,"def sort_sublists(data):
    return sorted(data, key=lambda x: sorted(x, key=str.lower))"
after_lora,MBPP,MBPP/105,count,True,,1.453,11,"def count(lst):
    return sum(lst)"
after_lora,MBPP,MBPP/106,add_lists,True,,2.086,16,"def add_lists(lst, tup):
    return tup + tuple(lst)"
after_lora,MBPP,MBPP/107,count_Hexadecimal,False,"Traceback (most recent call last):
  File ""/tmp/tmp7koua4sd.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 3, in check
AssertionError
",6.152,53,"def count_Hexadecimal(start, end):
    count = 0
    for n in range(start, end + 1):
        if n >= 0 and n <= 15:
            count += 1
    return count"
after_lora,MBPP,MBPP/108,merge_sorted_list,False,missing def merge_sorted_list,43.413,384,"8, 22, 25, 25, 35, 50, 58, 61, 65, 74, 75, 85]"
after_lora,MBPP,MBPP/109,odd_Equivalent,False,"Traceback (most recent call last):
  File ""/tmp/tmpz63133k4.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",12.342,109,"def odd_Equivalent(s, k):
    n = len(s)
    if n == 0: return 0
    if k == 1: return sum(int(ch) for ch in s) % 2
    if k % 2 == 0: return (sum(int(ch) for ch in s) % 2)
    return (sum(int(ch) for ch in s) % 2) + (sum(int(ch) for ch in s[1:]) % 2)"
after_lora,MBPP,MBPP/110,extract_missing,False,"Traceback (most recent call last):
  File ""/tmp/tmpw5luau0r.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",9.203,79,"def extract_missing(ranges, start, end):
    out = []
    for a, b in sorted(ranges):
        if a < start:
            out.append((start, a))
        if a < end:
            out.append((a, b))
        if b < end:
            out.append((b, end))
    return out"
after_lora,MBPP,MBPP/111,common_in_nested_lists,False,"Traceback (most recent call last):
  File ""/tmp/tmpsn84ndq7.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",5.879,50,"def common_in_nested_lists(nested):
    seen = set()
    for lst in nested:
        for item in lst:
            if item not in seen:
                seen.add(item)
    return sorted(seen)"
after_lora,MBPP,MBPP/112,perimeter,False,"Traceback (most recent call last):
  File ""/tmp/tmp6i062poo.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",2.431,20,"def perimeter(radius, height):
    return 2 * (2 * radius + height)"
after_lora,MBPP,MBPP/113,check_integer,True,,3.31,28,"def check_integer(s):
    try:
        int(s)
        return True
    except ValueError:
        return False"
after_lora,MBPP,MBPP/114,assign_freq,False,"Traceback (most recent call last):
  File ""/tmp/tmpqc_vf5kr.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",6.8,58,"def assign_freq(tuples):
    counts = {}
    for t in tuples:
        key = tuple(sorted(t))
        counts[key] = counts.get(key, 0) + 1
    return [counts[tuple(sorted(t))] for t in tuples]"
after_lora,MBPP,MBPP/115,empty_dit,True,,2.974,25,"def empty_dit(lst):
    for d in lst:
        if d: return False
    return True"
after_lora,MBPP,MBPP/116,tuple_to_int,True,,5.395,46,"def tuple_to_int(nums):
    if not nums:
        return 0
    result = 0
    for digit in nums:
        result = result * 10 + digit
    return result"
after_lora,MBPP,MBPP/117,list_to_float,False,"Traceback (most recent call last):
  File ""/tmp/tmpp0xbud6s.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",7.9,66,"def list_to_float(lst):
    out = []
    for a, b in lst:
        a = float(a) if a.strip() else 0.0
        b = float(b) if b.strip() else 0.0
        out.append((a, b))
    return out"
after_lora,MBPP,MBPP/118,string_to_list,True,,1.689,13,"def string_to_list(s):
    return s.split()"
after_lora,MBPP,MBPP/119,search,False,"Traceback (most recent call last):
  File ""/tmp/tmpbi42doc0.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",15.688,137,"def search(nums, target):
    left, right = 0, len(nums) - 1
    while left <= right:
        mid = (left + right) // 2
        if nums[mid] == target:
            if mid == 0 or nums[mid - 1] != target:
                return target
            if mid == len(nums) - 1 or nums[mid + 1] != target:
                return target
            left = mid + 1
        elif nums[mid] < target:
            left = mid + 1
        else:
            right = mid - 1
    return None"
after_lora,MBPP,MBPP/120,max_product_tuple,True,,5.416,46,"def max_product_tuple(tuples):
    best = 0
    for a, b in tuples:
        prod = a * b
        if prod > best:
            best = prod
    return best"
after_lora,MBPP,MBPP/121,check_triplet,False,"Traceback (most recent call last):
  File ""/tmp/tmph9_y0jr0.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
TypeError: check_triplet() takes 3 positional arguments but 4 were given
",13.798,119,"def check_triplet(nums, target, k):
    nums.sort()
    for i in range(len(nums) - 2):
        if i > 0 and nums[i] == nums[i - 1]: continue
        left, right = i + 1, len(nums) - 1
        while left < right:
            cur = nums[i] + nums[left] + nums[right]
            if cur == target: return True
            if cur < target: left += 1
            else: right -= 1
    return False"
after_lora,MBPP,MBPP/122,smartNumber,False,"Traceback (most recent call last):
  File ""/tmp/tmpp1ydj070.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",4.691,40,"def smartNumber(n):
    a, b = 0, 1
    for _ in range(n):
        a, b = b, a + b
    return a"
after_lora,MBPP,MBPP/123,amicable_numbers_sum,False,missing def amicable_numbers_sum,19.604,173,"def divisor_sum(x):
        s = 1
        p = 2
        while p * p <= x:
            if x % p == 0:
                s += p
                while x % p == 0:
                    x //= p
                s += x
            p += 1
        if x > 1:
            s += x
        return s
    seen = set()
    total = 0
    for i in range(1, n + 1):
        j = divisor_sum(i)
        if j == i:
            continue
        if j < i:
            continue
        if j not in seen:
            seen.add(j)
            total += i + j
    return total"
after_lora,MBPP,MBPP/124,angle_complex,False,"Traceback (most recent call last):
  File ""/tmp/tmp0dh5gceg.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
  File ""<string>"", line 4, in angle_complex
TypeError: must be real number, not complex
",2.651,21,"import math

def angle_complex(x, y):
    return math.atan2(y, x)"
after_lora,MBPP,MBPP/125,find_length,False,"Traceback (most recent call last):
  File ""/tmp/tmp6_1z77bc.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",11.133,97,"def find_length(s, n):
    if n <= 0:
        return 0
    dp = [0] * n
    dp[0] = 1 if s[0] == '1' else -1
    for i in range(1, n):
        dp[i] = dp[i-1] + 1 if s[i] == '1' else -dp[i-1]
    return max(dp)"
after_lora,MBPP,MBPP/126,sum,False,missing def sum,8.694,76,"def gcd(x, y):
        while y:
            x, y = y, x % y
        return x
    g = gcd(a, b)
    return sum(i for i in range(1, g + 1) if a % i == 0 and b % i == 0)"
after_lora,MBPP,MBPP/127,multiply_int,True,,9.954,86,"def multiply_int(a, b):
    if a == 0 or b == 0:
        return 0
    if a < 0:
        a = -a
        b = -b
    result = 0
    while b:
        if b & 1:
            result += a
        a <<= 1
        b >>= 1
    return result"
after_lora,MBPP,MBPP/128,long_words,False,"Traceback (most recent call last):
  File ""/tmp/tmp9o63wel2.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",2.927,24,"def long_words(n, words):
    return [word for word in words if len(word) > n]"
after_lora,MBPP,MBPP/129,magic_square_test,True,,15.953,140,"def magic_square_test(matrix):
    n = len(matrix)
    target = n * (n * n + 1) // 2
    seen = set()
    for row in matrix:
        for val in row:
            if val < 1 or val > n * n or val in seen:
                return False
            seen.add(val)
    for i in range(n):
        if sum(matrix[i]) != target or sum(matrix[j][i] for j in range(n)) != target or sum(matrix[j][n - 1 - j] for j in range(n)) != target:
            return False
    return True"
after_lora,MBPP,MBPP/130,max_occurrences,True,,8.963,78,"def max_occurrences(lst):
    counts = {}
    for x in lst:
        counts[x] = counts.get(x, 0) + 1
    max_val = max(counts.values())
    for k, v in counts.items():
        if v == max_val:
            return k, counts[k]
    return None, 0"
after_lora,MBPP,MBPP/131,reverse_vowels,True,,14.435,126,"def reverse_vowels(s: str) -> str:
    vowels = set('aeiouAEIOU')
    chars = list(s)
    left, right = 0, len(chars) - 1
    while left < right:
        if chars[left] not in vowels:
            left += 1
            continue
        if chars[right] not in vowels:
            right -= 1
            continue
        chars[left], chars[right] = chars[right], chars[left]
        left += 1
        right -= 1
    return ''.join(chars)"
after_lora,MBPP,MBPP/132,tup_string,True,,1.701,13,"def tup_string(t):
    return ''.join(t)"
after_lora,MBPP,MBPP/133,sum_negativenum,True,,2.825,23,"def sum_negativenum(nums):
    return sum(x for x in nums if x < 0)"
after_lora,MBPP,MBPP/134,check_last,False,"Traceback (most recent call last):
  File ""/tmp/tmpffnceham.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",13.406,117,"def check_last(nums, p, op):
    for _ in range(p):
        if op == ""add"":
            nums[-1] += nums[-1]
        elif op == ""subtract"":
            nums[-1] -= nums[-1]
        elif op == ""multiply"":
            nums[-1] *= nums[-1]
        elif op == ""divide"":
            nums[-1] //= nums[-1]
    return ""EVEN"" if nums[-1] % 2 == 0 else ""ODD"""
after_lora,MBPP,MBPP/135,hexagonal_num,True,,2.47,20,"def hexagonal_num(n):
    return n * (2 * n - 1)"
after_lora,MBPP,MBPP/136,cal_electbill,False,"Traceback (most recent call last):
  File ""/tmp/tmpg0ehf5ys.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",10.353,90,"def cal_electbill(kwh):
    if kwh <= 100:
        return kwh * 2.5
    elif kwh <= 200:
        return 250 + (kwh - 100) * 2.75
    else:
        return 525 + (kwh - 200) * 3.0"
after_lora,MBPP,MBPP/137,zero_count,False,"Traceback (most recent call last):
  File ""/tmp/tmph6seh6wp.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",3.972,33,"def zero_count(nums):
    return sum(1 for x in nums if x == 0) / len(nums) if nums else 0.0"
after_lora,MBPP,MBPP/138,is_Sum_Of_Powers_Of_Two,False,"Traceback (most recent call last):
  File ""/tmp/tmpto4_0e8_.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",6.58,56,"def is_Sum_Of_Powers_Of_Two(n: int) -> bool:
    if n <= 0:
        return False
    while n:
        if n & 1:
            return False
        n >>= 1
    return True"
after_lora,MBPP,MBPP/139,circle_circumference,False,"Traceback (most recent call last):
  File ""/tmp/tmposhz1bt7.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",4.139,35,"def circle_circumference(radius):
    return 2 * 3.141592653589793 * radius"
after_lora,MBPP,MBPP/140,extract_singly,False,"Traceback (most recent call last):
  File ""/tmp/tmpaaqkyx7a.py"", line 10, in <module>
    ns['check'](ns[entry])
  File ""<string>"", line 2, in check
AssertionError
",6.991,60,"def extract_singly(tuples):
    counts = {}
    for t in tuples:
        for v in t:
            counts[v] = counts.get(v, 0) + 1
    return [v for v in counts if counts[v] == 1]"