Skip to content

Latest commit

 

History

History
274 lines (254 loc) · 7.91 KB

94.md

File metadata and controls

274 lines (254 loc) · 7.91 KB

Results of GPT-4 on HumanEval/94

Date: 18 July, 2023
Model: gpt-4
Temperature: 0.2
Passing runs: 10
Total runs: 10
Success rate: 100%

Prompt

Tokens: 312

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
    """

The above is an incomplete Python code fragment. Return the complete and correct code with no additional text.

Correct solution

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 isPrime(n):
        for i in range(2,int(n**0.5)+1):
            if n%i==0:
                return False

        return True
    maxx = 0
    i = 0
    while i < len(lst):
        if(lst[i] > maxx and isPrime(lst[i])):
            maxx = lst[i]
        i+=1
    result = sum(int(digit) for digit in str(maxx))
    return result

Unit tests

def check(candidate):

    # Check some simple cases
    assert candidate([0,3,2,1,3,5,7,4,5,5,5,2,181,32,4,32,3,2,32,324,4,3]) == 10, "This prints if this assert fails 1 (good for debugging!)"

    # Check some edge cases that are easy to work out by hand.
    assert candidate([1,0,1,8,2,4597,2,1,3,40,1,2,1,2,4,2,5,1]) == 25, "This prints if this assert fails 2 (also good for debugging!)"

    # Check some edge cases that are easy to work out by hand.
    assert candidate([1,3,1,32,5107,34,83278,109,163,23,2323,32,30,1,9,3]) == 13, "This prints if this assert fails 3 (also good for debugging!)"

    # Check some edge cases that are easy to work out by hand.
    assert candidate([0,724,32,71,99,32,6,0,5,91,83,0,5,6]) == 11, "This prints if this assert fails 4 (also good for debugging!)"
    
    # Check some edge cases that are easy to work out by hand.
    assert candidate([0,81,12,3,1,21]) == 3, "This prints if this assert fails 5 (also good for debugging!)"

    # Check some edge cases that are easy to work out by hand.
    assert candidate([0,8,1,2,1,7]) == 7, "This prints if this assert fails 6 (also good for debugging!)"

    assert candidate([8191]) == 19, "This prints if this assert fails 7 (also good for debugging!)"
    assert candidate([8191, 123456, 127, 7]) == 19, "This prints if this assert fails 8 (also good for debugging!)"
    assert candidate([127, 97, 8192]) == 10, "This prints if this assert fails 9 (also good for debugging!)"

Runs

✅ Run 1

Start time: 2023-07-18 18:17:28
Duration: 8.46s
Completion tokens: 115
Result: Pass

def skjkasdkd(lst):
    def is_prime(n):
        if n < 2:
            return False
        for i in range(2, int(n**0.5) + 1):
            if n % i == 0:
                return False
        return True

    prime_nums = [i for i in lst if is_prime(i)]
    if not prime_nums:
        return 0
    largest_prime = max(prime_nums)
    return sum(int(digit) for digit in str(largest_prime))

✅ Run 2

Start time: 2023-07-18 18:17:22
Duration: 6.07s
Completion tokens: 90
Result: Pass

def skjkasdkd(lst):
    def is_prime(n):
        if n < 2:
            return False
        for i in range(2, int(n**0.5) + 1):
            if n % i == 0:
                return False
        return True

    max_prime = max(filter(is_prime, lst))
    return sum(int(digit) for digit in str(max_prime))

✅ Run 3

Start time: 2023-07-18 18:17:13
Duration: 8.43s
Completion tokens: 109
Result: Pass

def skjkasdkd(lst):
    def is_prime(n):
        if n < 2:
            return False
        for i in range(2, int(n**0.5) + 1):
            if n % i == 0:
                return False
        return True

    prime_numbers = [i for i in lst if is_prime(i)]
    if prime_numbers:
        return sum(int(digit) for digit in str(max(prime_numbers)))
    else:
        return 0

✅ Run 4

Start time: 2023-07-18 18:17:04
Duration: 8.98s
Completion tokens: 109
Result: Pass

def skjkasdkd(lst):
    def is_prime(n):
        if n < 2:
            return False
        for i in range(2, int(n**0.5) + 1):
            if n % i == 0:
                return False
        return True

    prime_numbers = [i for i in lst if is_prime(i)]
    if prime_numbers:
        return sum(int(digit) for digit in str(max(prime_numbers)))
    else:
        return 0

✅ Run 5

Start time: 2023-07-18 18:16:56
Duration: 7.79s
Completion tokens: 90
Result: Pass

def skjkasdkd(lst):
    def is_prime(n):
        if n < 2:
            return False
        for i in range(2, int(n**0.5) + 1):
            if n % i == 0:
                return False
        return True

    max_prime = max(filter(is_prime, lst))
    return sum(int(digit) for digit in str(max_prime))

✅ Run 6

Start time: 2023-07-18 18:16:49
Duration: 7.39s
Completion tokens: 115
Result: Pass

def skjkasdkd(lst):
    def is_prime(n):
        if n < 2:
            return False
        for i in range(2, int(n**0.5) + 1):
            if n % i == 0:
                return False
        return True

    prime_numbers = [i for i in lst if is_prime(i)]
    if not prime_numbers:
        return 0
    largest_prime = max(prime_numbers)
    return sum(int(digit) for digit in str(largest_prime))

✅ Run 7

Start time: 2023-07-18 18:16:43
Duration: 5.75s
Completion tokens: 90
Result: Pass

def skjkasdkd(lst):
    def is_prime(n):
        if n < 2:
            return False
        for i in range(2, int(n**0.5) + 1):
            if n % i == 0:
                return False
        return True

    max_prime = max(filter(is_prime, lst))
    return sum(int(digit) for digit in str(max_prime))

✅ Run 8

Start time: 2023-07-18 18:16:34
Duration: 9.24s
Completion tokens: 90
Result: Pass

def skjkasdkd(lst):
    def is_prime(n):
        if n < 2:
            return False
        for i in range(2, int(n**0.5) + 1):
            if n % i == 0:
                return False
        return True

    max_prime = max(filter(is_prime, lst))
    return sum(int(digit) for digit in str(max_prime))

✅ Run 9

Start time: 2023-07-18 18:16:24
Duration: 9.5s
Completion tokens: 106
Result: Pass

def skjkasdkd(lst):
    def is_prime(n):
        if n < 2:
            return False
        for i in range(2, int(n**0.5) + 1):
            if n % i == 0:
                return False
        return True

    primes = [i for i in lst if is_prime(i)]
    if primes:
        return sum(int(digit) for digit in str(max(primes)))
    else:
        return 0

✅ Run 10

Start time: 2023-07-18 18:16:15
Duration: 8.72s
Completion tokens: 90
Result: Pass

def skjkasdkd(lst):
    def is_prime(n):
        if n < 2:
            return False
        for i in range(2, int(n**0.5) + 1):
            if n % i == 0:
                return False
        return True

    max_prime = max(filter(is_prime, lst))
    return sum(int(digit) for digit in str(max_prime))