24.md

Results of GPT-3.5 on HumanEval/24

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

Prompt

Tokens: 78

def largest_divisor(n: int) -> int:
    """ For a given number n, find the largest number that divides n evenly, smaller than n
    >>> largest_divisor(15)
    5
    """

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

Correct solution

def largest_divisor(n: int) -> int:
    """ For a given number n, find the largest number that divides n evenly, smaller than n
    >>> largest_divisor(15)
    5
    """for i in reversed(range(n)):
        if n % i == 0:
            return i

Unit tests

METADATA = {
    'author': 'jt',
    'dataset': 'test'
}


def check(candidate):
    assert candidate(3) == 1
    assert candidate(7) == 1
    assert candidate(10) == 5
    assert candidate(100) == 50
    assert candidate(49) == 7

Runs

✅ Run 1

Start time: 2023-07-18 17:25:44
Duration: 3.32s
Completion tokens: 73
Result: Pass

def largest_divisor(n: int) -> int:
    """ For a given number n, find the largest number that divides n evenly, smaller than n
    >>> largest_divisor(15)
    5
    """
    for i in range(n-1, 0, -1):
        if n % i == 0:
            return i

✅ Run 2

Start time: 2023-07-18 17:25:41
Duration: 3.48s
Completion tokens: 73
Result: Pass

def largest_divisor(n: int) -> int:
    """ For a given number n, find the largest number that divides n evenly, smaller than n
    >>> largest_divisor(15)
    5
    """
    for i in range(n-1, 0, -1):
        if n % i == 0:
            return i

✅ Run 3

Start time: 2023-07-18 17:25:38
Duration: 2.46s
Completion tokens: 77
Result: Pass

def largest_divisor(n: int) -> int:
    """ For a given number n, find the largest number that divides n evenly, smaller than n
    >>> largest_divisor(15)
    5
    """
    for i in range(n-1, 0, -1):
        if n % i == 0:
            return i
    return None

✅ Run 4

Start time: 2023-07-18 17:25:34
Duration: 4.07s
Completion tokens: 77
Result: Pass

def largest_divisor(n: int) -> int:
    """ For a given number n, find the largest number that divides n evenly, smaller than n
    >>> largest_divisor(15)
    5
    """
    for i in range(n-1, 0, -1):
        if n % i == 0:
            return i
    return None

✅ Run 5

Start time: 2023-07-18 17:25:31
Duration: 2.8s
Completion tokens: 73
Result: Pass

def largest_divisor(n: int) -> int:
    """ For a given number n, find the largest number that divides n evenly, smaller than n
    >>> largest_divisor(15)
    5
    """
    for i in range(n-1, 0, -1):
        if n % i == 0:
            return i

✅ Run 6

Start time: 2023-07-18 17:25:28
Duration: 3.15s
Completion tokens: 73
Result: Pass

def largest_divisor(n: int) -> int:
    """ For a given number n, find the largest number that divides n evenly, smaller than n
    >>> largest_divisor(15)
    5
    """
    for i in range(n-1, 0, -1):
        if n % i == 0:
            return i

✅ Run 7

Start time: 2023-07-18 17:25:25
Duration: 3.16s
Completion tokens: 77
Result: Pass

def largest_divisor(n: int) -> int:
    """ For a given number n, find the largest number that divides n evenly, smaller than n
    >>> largest_divisor(15)
    5
    """
    for i in range(n-1, 0, -1):
        if n % i == 0:
            return i
    return None

✅ Run 8

Start time: 2023-07-18 17:25:21
Duration: 3.16s
Completion tokens: 73
Result: Pass

def largest_divisor(n: int) -> int:
    """ For a given number n, find the largest number that divides n evenly, smaller than n
    >>> largest_divisor(15)
    5
    """
    for i in range(n-1, 0, -1):
        if n % i == 0:
            return i

✅ Run 9

Start time: 2023-07-18 17:25:18
Duration: 3.22s
Completion tokens: 73
Result: Pass

def largest_divisor(n: int) -> int:
    """ For a given number n, find the largest number that divides n evenly, smaller than n
    >>> largest_divisor(15)
    5
    """
    for i in range(n-1, 0, -1):
        if n % i == 0:
            return i

✅ Run 10

Start time: 2023-07-18 17:25:15
Duration: 3.15s
Completion tokens: 73
Result: Pass

def largest_divisor(n: int) -> int:
    """ For a given number n, find the largest number that divides n evenly, smaller than n
    >>> largest_divisor(15)
    5
    """
    for i in range(n-1, 0, -1):
        if n % i == 0:
            return i