Run Details #741

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):
    if not isinstance(n, int):  # TypeError: 'int' object is not iterable
        raise TypeError("Input must be an integer.")
    if n <= 1:  # ValueError: Input must be greater than 1
        raise ValueError("Input must be a positive integer.")
    
    factors = []
    divisor = 2
    
    while n > 1:
        count = 0
        while n % divisor == 0:  # while loop to find the power of divisor in number
            n //= divisor
            count += 1
        if count > 0:
            factors.append(divisor)
        else:
            divisor += 1
    
    return sorted(factors)  # Sort the list before returning it