wegho-agentes 7.0.3 → 7.0.6

package/skills/loki-mode/benchmarks/results/humaneval-loki-solutions/87.py

@@ -1,31 +0,0 @@
-# HumanEval/87
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def get_row(lst, x):
-    """
-    You are given a 2 dimensional data, as a nested lists,
-    which is similar to matrix, however, unlike matrices,
-    each row may contain a different number of columns.
-    Given lst, and integer x, find integers x in the list,
-    and return list of tuples, [(x1, y1), (x2, y2) ...] such that
-    each tuple is a coordinate - (row, columns), starting with 0.
-    Sort coordinates initially by rows in ascending order.
-    Also, sort coordinates of the row by columns in descending order.
-    
-    Examples:
-    get_row([
-      [1,2,3,4,5,6],
-      [1,2,3,4,1,6],
-      [1,2,3,4,5,1]
-    ], 1) == [(0, 0), (1, 4), (1, 0), (2, 5), (2, 0)]
-    get_row([], 1) == []
-    get_row([[], [1], [1, 2, 3]], 3) == [(2, 2)]
-    """
-    result = []
-    for row in range(len(lst)):
-        for col in range(len(lst[row]) - 1, -1, -1):
-            if lst[row][col] == x:
-                result.append((row, col))
-    return result

package/skills/loki-mode/benchmarks/results/humaneval-loki-solutions/88.py

@@ -1,29 +0,0 @@
-# HumanEval/88
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def sort_array(array):
-    """
-    Given an array of non-negative integers, return a copy of the given array after sorting,
-    you will sort the given array in ascending order if the sum( first index value, last index value) is odd,
-    or sort it in descending order if the sum( first index value, last index value) is even.
-
-    Note:
-    * don't change the given array.
-
-    Examples:
-    * sort_array([]) => []
-    * sort_array([5]) => [5]
-    * sort_array([2, 4, 3, 0, 1, 5]) => [0, 1, 2, 3, 4, 5]
-    * sort_array([2, 4, 3, 0, 1, 5, 6]) => [6, 5, 4, 3, 2, 1, 0]
-    """
-    if not array:
-        return []
-    
-    first_last_sum = array[0] + array[-1]
-    
-    if first_last_sum % 2 == 1:
-        return sorted(array)
-    else:
-        return sorted(array, reverse=True)

package/skills/loki-mode/benchmarks/results/humaneval-loki-solutions/89.py

@@ -1,25 +0,0 @@
-# HumanEval/89
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def encrypt(s):
-    """Create a function encrypt that takes a string as an argument and
-    returns a string encrypted with the alphabet being rotated. 
-    The alphabet should be rotated in a manner such that the letters 
-    shift down by two multiplied to two places.
-    For example:
-    encrypt('hi') returns 'lm'
-    encrypt('asdfghjkl') returns 'ewhjklnop'
-    encrypt('gf') returns 'kj'
-    encrypt('et') returns 'ix'
-    """
-    result = []
-    for c in s:
-        if c.islower():
-            result.append(chr((ord(c) - ord('a') + 4) % 26 + ord('a')))
-        elif c.isupper():
-            result.append(chr((ord(c) - ord('A') + 4) % 26 + ord('A')))
-        else:
-            result.append(c)
-    return ''.join(result)

package/skills/loki-mode/benchmarks/results/humaneval-loki-solutions/9.py

@@ -1,25 +0,0 @@
-# HumanEval/9
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-from typing import List, Tuple
-
-
-def rolling_max(numbers: List[int]) -> List[int]:
-    """ From a given list of integers, generate a list of rolling maximum element found until given moment
-    in the sequence.
-    >>> rolling_max([1, 2, 3, 2, 3, 4, 2])
-    [1, 2, 3, 3, 3, 4, 4]
-    """
-    if not numbers:
-        return []
-    
-    result = []
-    current_max = numbers[0]
-    
-    for num in numbers:
-        current_max = max(current_max, num)
-        result.append(current_max)
-    
-    return result

package/skills/loki-mode/benchmarks/results/humaneval-loki-solutions/90.py

@@ -1,21 +0,0 @@
-# HumanEval/90
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def next_smallest(lst):
-    """
-    You are given a list of integers.
-    Write a function next_smallest() that returns the 2nd smallest element of the list.
-    Return None if there is no such element.
-    
-    next_smallest([1, 2, 3, 4, 5]) == 2
-    next_smallest([5, 1, 4, 3, 2]) == 2
-    next_smallest([]) == None
-    next_smallest([1, 1]) == None
-    """
-    unique_values = set(lst)
-    if len(unique_values) < 2:
-        return None
-    sorted_unique = sorted(unique_values)
-    return sorted_unique[1]

package/skills/loki-mode/benchmarks/results/humaneval-loki-solutions/91.py

@@ -1,31 +0,0 @@
-# HumanEval/91
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def is_bored(S):
-    """
-    You'll be given a string of words, and your task is to count the number
-    of boredoms. A boredom is a sentence that starts with the word "I".
-    Sentences are delimited by '.', '?' or '!'.
-   
-    For example:
-    >>> is_bored("Hello world")
-    0
-    >>> is_bored("The sky is blue. The sun is shining. I love this weather")
-    1
-    """
-    import re
-    
-    if not S:
-        return 0
-    
-    sentences = re.split(r'[.?!]', S)
-    count = 0
-    
-    for sentence in sentences:
-        stripped = sentence.lstrip()
-        if stripped == "I" or stripped.startswith("I "):
-            count += 1
-    
-    return count

package/skills/loki-mode/benchmarks/results/humaneval-loki-solutions/92.py

@@ -1,29 +0,0 @@
-# HumanEval/92
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def any_int(x, y, z):
-    '''
-    Create a function that takes 3 numbers.
-    Returns true if one of the numbers is equal to the sum of the other two, and all numbers are integers.
-    Returns false in any other cases.
-    
-    Examples
-    any_int(5, 2, 7) ➞ True
-    
-    any_int(3, 2, 2) ➞ False
-
-    any_int(3, -2, 1) ➞ True
-    
-    any_int(3.6, -2.2, 2) ➞ False
-  
-
-    
-    '''
-    # Check all three are integers but not bools
-    if not all(isinstance(n, int) and not isinstance(n, bool) for n in [x, y, z]):
-        return False
-    
-    # Check if any one equals the sum of the other two
-    return x == y + z or y == x + z or z == x + y

package/skills/loki-mode/benchmarks/results/humaneval-loki-solutions/93.py

@@ -1,30 +0,0 @@
-# HumanEval/93
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def encode(message):
-    """
-    Write a function that takes a message, and encodes in such a 
-    way that it swaps case of all letters, replaces all vowels in 
-    the message with the letter that appears 2 places ahead of that 
-    vowel in the english alphabet. 
-    Assume only letters. 
-    
-    Examples:
-    >>> encode('test')
-    'TGST'
-    >>> encode('This is a message')
-    'tHKS KS C MGSSCGG'
-    """
-    vowels = 'aeiouAEIOU'
-    result = []
-    
-    for char in message:
-        swapped = char.swapcase()
-        if swapped in vowels:
-            result.append(chr(ord(swapped) + 2))
-        else:
-            result.append(swapped)
-    
-    return ''.join(result)

package/skills/loki-mode/benchmarks/results/humaneval-loki-solutions/94.py

@@ -1,32 +0,0 @@
-# HumanEval/94
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-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:
-            return True
-        if n % 2 == 0:
-            return False
-        for i in range(3, int(n**0.5) + 1, 2):
-            if n % i == 0:
-                return False
-        return True
-    
-    primes = [x for x in lst if is_prime(x)]
-    largest_prime = max(primes)
-    return sum(int(d) for d in str(largest_prime))

package/skills/loki-mode/benchmarks/results/humaneval-loki-solutions/95.py

@@ -1,32 +0,0 @@
-# HumanEval/95
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def check_dict_case(dict):
-    """
-    Given a dictionary, return True if all keys are strings in lower 
-    case or all keys are strings in upper case, else return False.
-    The function should return False is the given dictionary is empty.
-    Examples:
-    check_dict_case({"a":"apple", "b":"banana"}) should return True.
-    check_dict_case({"a":"apple", "A":"banana", "B":"banana"}) should return False.
-    check_dict_case({"a":"apple", 8:"banana", "a":"apple"}) should return False.
-    check_dict_case({"Name":"John", "Age":"36", "City":"Houston"}) should return False.
-    check_dict_case({"STATE":"NC", "ZIP":"12345" }) should return True.
-    """
-    if len(dict) == 0:
-        return False
-    
-    all_lower = True
-    all_upper = True
-    
-    for key in dict:
-        if not isinstance(key, str):
-            return False
-        if not key.islower():
-            all_lower = False
-        if not key.isupper():
-            all_upper = False
-    
-    return all_lower or all_upper

package/skills/loki-mode/benchmarks/results/humaneval-loki-solutions/96.py

@@ -1,38 +0,0 @@
-# HumanEval/96
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def count_up_to(n):
-    """Implement a function that takes an non-negative integer and returns an array of the first n
-    integers that are prime numbers and less than n.
-    for example:
-    count_up_to(5) => [2,3]
-    count_up_to(11) => [2,3,5,7]
-    count_up_to(0) => []
-    count_up_to(20) => [2,3,5,7,11,13,17,19]
-    count_up_to(1) => []
-    count_up_to(18) => [2,3,5,7,11,13,17]
-    """
-    if n <= 2:
-        return []
-    
-    def is_prime(num):
-        if num < 2:
-            return False
-        if num == 2:
-            return True
-        if num % 2 == 0:
-            return False
-        i = 3
-        while i * i <= num:
-            if num % i == 0:
-                return False
-            i += 2
-        return True
-    
-    primes = []
-    for num in range(2, n):
-        if is_prime(num):
-            primes.append(num)
-    return primes

package/skills/loki-mode/benchmarks/results/humaneval-loki-solutions/97.py

@@ -1,16 +0,0 @@
-# HumanEval/97
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def multiply(a, b):
-    """Complete the function that takes two integers and returns 
-    the product of their unit digits.
-    Assume the input is always valid.
-    Examples:
-    multiply(148, 412) should return 16.
-    multiply(19, 28) should return 72.
-    multiply(2020, 1851) should return 0.
-    multiply(14,-15) should return 20.
-    """
-    return (abs(a) % 10) * (abs(b) % 10)

package/skills/loki-mode/benchmarks/results/humaneval-loki-solutions/98.py

@@ -1,20 +0,0 @@
-# HumanEval/98
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def count_upper(s):
-    """
-    Given a string s, count the number of uppercase vowels in even indices.
-    
-    For example:
-    count_upper('aBCdEf') returns 1
-    count_upper('abcdefg') returns 0
-    count_upper('dBBE') returns 0
-    """
-    uppercase_vowels = {'A', 'E', 'I', 'O', 'U'}
-    count = 0
-    for i in range(0, len(s), 2):
-        if s[i] in uppercase_vowels:
-            count += 1
-    return count

package/skills/loki-mode/benchmarks/results/humaneval-loki-solutions/99.py

@@ -1,36 +0,0 @@
-# HumanEval/99
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def closest_integer(value):
-    '''
-    Create a function that takes a value (string) representing a number
-    and returns the closest integer to it. If the number is equidistant
-    from two integers, round it away from zero.
-
-    Examples
-    >>> closest_integer("10")
-    10
-    >>> closest_integer("15.3")
-    15
-
-    Note:
-    Rounding away from zero means that if the given number is equidistant
-    from two integers, the one you should return is the one that is the
-    farthest from zero. For example closest_integer("14.5") should
-    return 15 and closest_integer("-14.5") should return -15.
-    '''
-    from math import floor, ceil
-    
-    num = float(value)
-    
-    # Check if the number is equidistant from two integers (ends in .5)
-    if abs(num - round(num)) == 0.5 or (num != int(num) and abs(num % 1) == 0.5):
-        # Round away from zero
-        if num > 0:
-            return ceil(num)
-        else:
-            return floor(num)
-    else:
-        return round(num)