Run Details #1060

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 type(n) is not int:
        raise TypeError("Input must be an integer.")
    if n <= 1:
        raise ValueError("Input must be greater than 1.")

    factors = []
    d = 2
    temp_n = n
    while d * d <= temp_n:
        while temp_n % d == 0:
            factors.append(d)
            temp_n //= d
        d += 1
    if temp_n > 1:
        factors.append(temp_n)
    return factors