wegho-agentes 7.0.3 → 7.0.6

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

@@ -1,23 +0,0 @@
-# HumanEval/4
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-from typing import List
-
-
-def mean_absolute_deviation(numbers: List[float]) -> float:
-    """ For a given list of input numbers, calculate Mean Absolute Deviation
-    around the mean of this dataset.
-    Mean Absolute Deviation is the average absolute difference between each
-    element and a centerpoint (mean in this case):
-    MAD = average | x - x_mean |
-    >>> mean_absolute_deviation([1.0, 2.0, 3.0, 4.0])
-    1.0
-    """
-    if not numbers:
-        return 0.0
-    
-    mean = sum(numbers) / len(numbers)
-    absolute_deviations = [abs(x - mean) for x in numbers]
-    return sum(absolute_deviations) / len(absolute_deviations)

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

@@ -1,43 +0,0 @@
-# HumanEval/40
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def triples_sum_to_zero(l: list):
-    """
-    triples_sum_to_zero takes a list of integers as an input.
-    it returns True if there are three distinct elements in the list that
-    sum to zero, and False otherwise.
-
-    >>> triples_sum_to_zero([1, 3, 5, 0])
-    False
-    >>> triples_sum_to_zero([1, 3, -2, 1])
-    True
-    >>> triples_sum_to_zero([1, 2, 3, 7])
-    False
-    >>> triples_sum_to_zero([2, 4, -5, 3, 9, 7])
-    True
-    >>> triples_sum_to_zero([1])
-    False
-    """
-    n = len(l)
-    if n < 3:
-        return False
-    
-    sorted_list = sorted(l)
-    
-    for i in range(n - 2):
-        target = -sorted_list[i]
-        left = i + 1
-        right = n - 1
-        
-        while left < right:
-            current_sum = sorted_list[left] + sorted_list[right]
-            if current_sum == target:
-                return True
-            elif current_sum < target:
-                left += 1
-            else:
-                right -= 1
-    
-    return False

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

@@ -1,18 +0,0 @@
-# HumanEval/41
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def car_race_collision(n: int):
-    """
-    Imagine a road that's a perfectly straight infinitely long line.
-    n cars are driving left to right;  simultaneously, a different set of n cars
-    are driving right to left.   The two sets of cars start out being very far from
-    each other.  All cars move in the same speed.  Two cars are said to collide
-    when a car that's moving left to right hits a car that's moving right to left.
-    However, the cars are infinitely sturdy and strong; as a result, they continue moving
-    in their trajectory as if they did not collide.
-
-    This function outputs the number of such collisions.
-    """
-    return n * n

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

@@ -1,13 +0,0 @@
-# HumanEval/42
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def incr_list(l: list):
-    """Return list with elements incremented by 1.
-    >>> incr_list([1, 2, 3])
-    [2, 3, 4]
-    >>> incr_list([5, 3, 5, 2, 3, 3, 9, 0, 123])
-    [6, 4, 6, 3, 4, 4, 10, 1, 124]
-    """
-    return [x + 1 for x in l]

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

@@ -1,27 +0,0 @@
-# HumanEval/43
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def pairs_sum_to_zero(l):
-    """
-    pairs_sum_to_zero takes a list of integers as an input.
-    it returns True if there are two distinct elements in the list that
-    sum to zero, and False otherwise.
-    >>> pairs_sum_to_zero([1, 3, 5, 0])
-    False
-    >>> pairs_sum_to_zero([1, 3, -2, 1])
-    False
-    >>> pairs_sum_to_zero([1, 2, 3, 7])
-    False
-    >>> pairs_sum_to_zero([2, 4, -5, 3, 5, 7])
-    True
-    >>> pairs_sum_to_zero([1])
-    False
-    """
-    seen = set()
-    for num in l:
-        if -num in seen:
-            return True
-        seen.add(num)
-    return False

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

@@ -1,25 +0,0 @@
-# HumanEval/44
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def change_base(x: int, base: int):
-    """Change numerical base of input number x to base.
-    return string representation after the conversion.
-    base numbers are less than 10.
-    >>> change_base(8, 3)
-    '22'
-    >>> change_base(8, 2)
-    '1000'
-    >>> change_base(7, 2)
-    '111'
-    """
-    if x == 0:
-        return '0'
-    
-    digits = []
-    while x > 0:
-        digits.append(str(x % base))
-        x //= base
-    
-    return ''.join(reversed(digits))

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

@@ -1,11 +0,0 @@
-# HumanEval/45
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def triangle_area(a, h):
-    """Given length of a side and high return area for a triangle.
-    >>> triangle_area(5, 3)
-    7.5
-    """
-    return (a * h) / 2

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

@@ -1,35 +0,0 @@
-# HumanEval/46
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def fib4(n: int):
-    """The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
-    fib4(0) -> 0
-    fib4(1) -> 0
-    fib4(2) -> 2
-    fib4(3) -> 0
-    fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).
-    Please write a function to efficiently compute the n-th element of the fib4 number sequence.  Do not use recursion.
-    >>> fib4(5)
-    4
-    >>> fib4(6)
-    8
-    >>> fib4(7)
-    14
-    """
-    if n == 0:
-        return 0
-    if n == 1:
-        return 0
-    if n == 2:
-        return 2
-    if n == 3:
-        return 0
-    
-    a, b, c, d = 0, 0, 2, 0
-    
-    for _ in range(4, n + 1):
-        a, b, c, d = b, c, d, a + b + c + d
-    
-    return d

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

@@ -1,19 +0,0 @@
-# HumanEval/47
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def median(l: list):
-    """Return median of elements in the list l.
-    >>> median([3, 1, 2, 4, 5])
-    3
-    >>> median([-10, 4, 6, 1000, 10, 20])
-    15.0
-    """
-    sorted_l = sorted(l)
-    n = len(sorted_l)
-    mid = n // 2
-    if n % 2 == 1:
-        return sorted_l[mid]
-    else:
-        return (sorted_l[mid - 1] + sorted_l[mid]) / 2

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

@@ -1,18 +0,0 @@
-# HumanEval/48
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def is_palindrome(text: str):
-    """
-    Checks if given string is a palindrome
-    >>> is_palindrome('')
-    True
-    >>> is_palindrome('aba')
-    True
-    >>> is_palindrome('aaaaa')
-    True
-    >>> is_palindrome('zbcd')
-    False
-    """
-    return text == text[::-1]

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

@@ -1,26 +0,0 @@
-# HumanEval/49
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def modp(n: int, p: int):
-    """Return 2^n modulo p (be aware of numerics).
-    >>> modp(3, 5)
-    3
-    >>> modp(1101, 101)
-    2
-    >>> modp(0, 101)
-    1
-    >>> modp(3, 11)
-    8
-    >>> modp(100, 101)
-    1
-    """
-    result = 1
-    base = 2 % p
-    while n > 0:
-        if n % 2 == 1:
-            result = (result * base) % p
-        n = n // 2
-        base = (base * base) % p
-    return result

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

@@ -1,25 +0,0 @@
-# HumanEval/5
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-from typing import List
-
-
-def intersperse(numbers: List[int], delimeter: int) -> List[int]:
-    """ Insert a number 'delimeter' between every two consecutive elements of input list `numbers'
-    >>> intersperse([], 4)
-    []
-    >>> intersperse([1, 2, 3], 4)
-    [1, 4, 2, 4, 3]
-    """
-    if not numbers:
-        return []
-    
-    result = []
-    for i, num in enumerate(numbers):
-        result.append(num)
-        if i < len(numbers) - 1:
-            result.append(delimeter)
-    
-    return result

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

@@ -1,10 +0,0 @@
-# HumanEval/50
-# Loki Mode Multi-Agent Solution
-# Attempts: 3
-# Passed: False
-
-def decode_shift(s: str):
-    """
-    takes as input string encoded with encode_shift function. Returns decoded string.
-    """
-    return "".join([chr(((ord(ch) - 5 - ord("a")) % 26) + ord("a")) for ch in s])

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

@@ -1,23 +0,0 @@
-# HumanEval/51
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def remove_vowels(text):
-    """
-    remove_vowels is a function that takes string and returns string without vowels.
-    >>> remove_vowels('')
-    ''
-    >>> remove_vowels("abcdef\nghijklm")
-    'bcdf\nghjklm'
-    >>> remove_vowels('abcdef')
-    'bcdf'
-    >>> remove_vowels('aaaaa')
-    ''
-    >>> remove_vowels('aaBAA')
-    'B'
-    >>> remove_vowels('zbcd')
-    'zbcd'
-    """
-    vowels = {'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'}
-    return ''.join(char for char in text if char not in vowels)

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

@@ -1,13 +0,0 @@
-# HumanEval/52
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def below_threshold(l: list, t: int):
-    """Return True if all numbers in the list l are below threshold t.
-    >>> below_threshold([1, 2, 4, 10], 100)
-    True
-    >>> below_threshold([1, 20, 4, 10], 5)
-    False
-    """
-    return all(x < t for x in l)

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

@@ -1,13 +0,0 @@
-# HumanEval/53
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def add(x: int, y: int):
-    """Add two numbers x and y
-    >>> add(2, 3)
-    5
-    >>> add(5, 7)
-    12
-    """
-    return x + y

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

@@ -1,22 +0,0 @@
-# HumanEval/54
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def same_chars(s0: str, s1: str):
-    """
-    Check if two words have the same characters.
-    >>> same_chars('eabcdzzzz', 'dddzzzzzzzddeddabc')
-    True
-    >>> same_chars('abcd', 'dddddddabc')
-    True
-    >>> same_chars('dddddddabc', 'abcd')
-    True
-    >>> same_chars('eabcd', 'dddddddabc')
-    False
-    >>> same_chars('abcd', 'dddddddabce')
-    False
-    >>> same_chars('eabcdzzzz', 'dddzzzzzzzddddabc')
-    False
-    """
-    return set(s0) == set(s1)

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

@@ -1,20 +0,0 @@
-# HumanEval/55
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def fib(n: int):
-    """Return n-th Fibonacci number.
-    >>> fib(10)
-    55
-    >>> fib(1)
-    1
-    >>> fib(8)
-    21
-    """
-    if n <= 2:
-        return 1
-    a, b = 1, 1
-    for _ in range(n - 2):
-        a, b = b, a + b
-    return b

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

@@ -1,27 +0,0 @@
-# HumanEval/56
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def correct_bracketing(brackets: str):
-    """ brackets is a string of "<" and ">".
-    return True if every opening bracket has a corresponding closing bracket.
-
-    >>> correct_bracketing("<")
-    False
-    >>> correct_bracketing("<>")
-    True
-    >>> correct_bracketing("<<><>>")
-    True
-    >>> correct_bracketing("><<>")
-    False
-    """
-    counter = 0
-    for bracket in brackets:
-        if bracket == "<":
-            counter += 1
-        elif bracket == ">":
-            counter -= 1
-        if counter < 0:
-            return False
-    return counter == 0

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

@@ -1,27 +0,0 @@
-# HumanEval/57
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def monotonic(l: list):
-    """Return True is list elements are monotonically increasing or decreasing.
-    >>> monotonic([1, 2, 4, 20])
-    True
-    >>> monotonic([1, 20, 4, 10])
-    False
-    >>> monotonic([4, 1, 0, -10])
-    True
-    """
-    if len(l) <= 1:
-        return True
-    
-    increasing = True
-    decreasing = True
-    
-    for i in range(1, len(l)):
-        if l[i] > l[i - 1]:
-            decreasing = False
-        if l[i] < l[i - 1]:
-            increasing = False
-    
-    return increasing or decreasing

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

@@ -1,14 +0,0 @@
-# HumanEval/58
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def common(l1: list, l2: list):
-    """Return sorted unique common elements for two lists.
-    >>> common([1, 4, 3, 34, 653, 2, 5], [5, 7, 1, 5, 9, 653, 121])
-    [1, 5, 653]
-    >>> common([5, 3, 2, 8], [3, 2])
-    [2, 3]
-
-    """
-    return sorted(set(l1) & set(l2))

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

@@ -1,32 +0,0 @@
-# HumanEval/59
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def largest_prime_factor(n: int):
-    """Return the largest prime factor of n. Assume n > 1 and is not a prime.
-    >>> largest_prime_factor(13195)
-    29
-    >>> largest_prime_factor(2048)
-    2
-    """
-    largest = 1
-    
-    # Divide out all factors of 2
-    while n % 2 == 0:
-        largest = 2
-        n //= 2
-    
-    # Check odd factors starting from 3
-    factor = 3
-    while factor * factor <= n:
-        while n % factor == 0:
-            largest = factor
-            n //= factor
-        factor += 2
-    
-    # If n is still greater than 1, it's a prime factor
-    if n > 1:
-        largest = n
-    
-    return largest

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

@@ -1,33 +0,0 @@
-# HumanEval/6
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-from typing import List
-
-
-def parse_nested_parens(paren_string: str) -> List[int]:
-    """ Input to this function is a string represented multiple groups for nested parentheses separated by spaces.
-    For each of the group, output the deepest level of nesting of parentheses.
-    E.g. (()()) has maximum two levels of nesting while ((())) has three.
-
-    >>> parse_nested_parens('(()()) ((())) () ((())()())')
-    [2, 3, 1, 3]
-    """
-    result = []
-    groups = paren_string.split()
-    
-    for group in groups:
-        if not group:
-            continue
-        max_depth = 0
-        current_depth = 0
-        for char in group:
-            if char == '(':
-                current_depth += 1
-                max_depth = max(max_depth, current_depth)
-            elif char == ')':
-                current_depth -= 1
-        result.append(max_depth)
-    
-    return result

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

@@ -1,19 +0,0 @@
-# HumanEval/60
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def sum_to_n(n: int):
-    """sum_to_n is a function that sums numbers from 1 to n.
-    >>> sum_to_n(30)
-    465
-    >>> sum_to_n(100)
-    5050
-    >>> sum_to_n(5)
-    15
-    >>> sum_to_n(10)
-    55
-    >>> sum_to_n(1)
-    1
-    """
-    return n * (n + 1) // 2

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

@@ -1,27 +0,0 @@
-# HumanEval/61
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def correct_bracketing(brackets: str):
-    """ brackets is a string of "(" and ")".
-    return True if every opening bracket has a corresponding closing bracket.
-
-    >>> correct_bracketing("(")
-    False
-    >>> correct_bracketing("()")
-    True
-    >>> correct_bracketing("(()())")
-    True
-    >>> correct_bracketing(")(()")
-    False
-    """
-    counter = 0
-    for char in brackets:
-        if char == "(":
-            counter += 1
-        elif char == ")":
-            counter -= 1
-        if counter < 0:
-            return False
-    return counter == 0

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

@@ -1,15 +0,0 @@
-# HumanEval/62
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def derivative(xs: list):
-    """ xs represent coefficients of a polynomial.
-    xs[0] + xs[1] * x + xs[2] * x^2 + ....
-     Return derivative of this polynomial in the same form.
-    >>> derivative([3, 1, 2, 4, 5])
-    [1, 4, 12, 20]
-    >>> derivative([1, 2, 3])
-    [2, 6]
-    """
-    return [xs[i] * i for i in range(1, len(xs))]

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

@@ -1,30 +0,0 @@
-# HumanEval/63
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def fibfib(n: int):
-    """The FibFib number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
-    fibfib(0) == 0
-    fibfib(1) == 0
-    fibfib(2) == 1
-    fibfib(n) == fibfib(n-1) + fibfib(n-2) + fibfib(n-3).
-    Please write a function to efficiently compute the n-th element of the fibfib number sequence.
-    >>> fibfib(1)
-    0
-    >>> fibfib(5)
-    4
-    >>> fibfib(8)
-    24
-    """
-    if n == 0:
-        return 0
-    if n == 1:
-        return 0
-    if n == 2:
-        return 1
-    
-    a, b, c = 0, 0, 1
-    for _ in range(3, n + 1):
-        a, b, c = b, c, a + b + c
-    return c

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

@@ -1,29 +0,0 @@
-# HumanEval/64
-# Loki Mode Multi-Agent Solution
-# Attempts: 1
-# Passed: True
-
-def vowels_count(s):
-    """Write a function vowels_count which takes a string representing
-    a word as input and returns the number of vowels in the string.
-    Vowels in this case are 'a', 'e', 'i', 'o', 'u'. Here, 'y' is also a
-    vowel, but only when it is at the end of the given word.
-
-    Example:
-    >>> vowels_count("abcde")
-    2
-    >>> vowels_count("ACEDY")
-    3
-    """
-    vowels = "aeiou"
-    s_lower = s.lower()
-    count = 0
-    
-    for char in s_lower:
-        if char in vowels:
-            count += 1
-    
-    if s_lower and s_lower[-1] == 'y':
-        count += 1
-    
-    return count