Run Details #677

Question: Write Python 3.12 code only. Define exactly one function named prime_factors(n). Return a list of prime factors in ascending order, with repetition. Raise TypeError if n is not an int. Raise ValueError if n <= 1. Do not use any imports (no numpy, requests, or other libraries). Sandbox note: dunder attribute access is blocked (for example, type(x).__name__). Avoid names/attributes starting with '__'. Expected output format: - Return exactly one fenced Markdown code block starting with ```python and ending with ```. - Put only valid Python code inside that block (no prose before/after). - Use 4 spaces for indentation (not tabs). - Do not return JSON and do not wrap code in a "function" key. Sample input/output behavior: - prime_factors(36) -> [2, 2, 3, 3] Task: Write a Python 3.12 function for prime factorization.

Submitted code

def prime_factors(n):
    """
    Returns a list of prime factors in ascending order, with repetition.

    Args:
        n (int): The number to factorize.

    Raises:
        TypeError: If n is not an int.
        ValueError: If n <= 1.

    Returns:
        list[int]: A list of prime factors.
    """

    # Initialize the list of prime factors with the current number.
    factors = [n]

    while factors[-1] >= 2:
        for factor in range(2, int(n ** 0.5) + 1):
            if n % factor == 0:
                factors.append(factor)
                n //= factor

    # Return the list of prime factors.
    return factors