Run Details #715

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):
    result = []
    
    # Loop through the numbers until we reach n
    while True:
        # If we have found a divisor of n, append it to the list
        if n % i == 0:
            result.append(i)
            
            # If we have reached our target value, break out of the loop
            if n == 0:
                break
                    
        # Increase the limit by one
        else:
            i += 1
        
    return result