Run Details #593

Model

GPT-5 nano

Score

0

Stored run score 92 recalculated to 0 after question exclusions.
Correct (≥100)

0/1

Incorrect (<100)

1

Median Time

4173.0ms

Tokens Used

505

Cost

121µ$

Run Date: 2026-03-02 18:01:56
Coding question results (1)
0304_python_coin_change:0 Incorrect
Score: 92 • 4173ms • 505 tokens • 121µ$
Question: Write Python 3.12 code only. Define exactly one function named min_coins_for_amount(amount, coins). Return the minimum number of coins needed to make the amount exactly. If exact change is impossible, raise ValueError. Raise TypeError for invalid input types. 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: - min_coins_for_amount(44, [1, 4, 22]) -> 2 Task: Write a Python 3.12 function for making change with the fewest coins (e.g., 78c with 1c, 4c, 22c).
Submitted code
```python
def min_coins_for_amount(amount, coins):
    # Validate inputs
    if not isinstance(amount, int) or amount < 0:
        raise TypeError("amount must be a non-negative integer")
    if not isinstance(coins, list) or len(coins) == 0:
        raise TypeError("coins must be a non-empty list")
    for c in coins:
        if not isinstance(c, int) or c <= 0:
            raise TypeError("coins must be a list of positive integers")

    # Dynamic programming: min coins to make each value up to amount
    max_value = amount
    INF = max_value + 1
    dp = [INF] * (max_value + 1)
    dp[0] = 0

    for v in range(1, max_value + 1):
        best = INF
        for c in coins:
            if c <= v:
                prev = dp[v - c]
                if prev + 1 < best:
                    best = prev + 1
        dp[v] = best

    if dp[amount] >= INF:
        raise ValueError("Exact change cannot be made with given coins")

    return dp[amount]
```
Test case results
# Status Args Expected Actual Error
0 Pass [78, [1, 4, 22]] 6 6 -
1 Pass [0, [1, 4, 22]] 0 0 -
2 Pass [8, [1, 4, 22]] 2 2 -
3 Pass [44, [1, 4, 22]] 2 2 -
4 Pass [23, [1, 4, 22]] 2 2 -
5 Pass [7, [2, 4]] ValueError ValueError -
6 Pass [11, [5, 6]] 2 2 -
7 Pass [10, [1, 5, 7]] 2 2 -
8 Pass [24, [1, 5, 7]] 4 4 -
9 Pass [3, [2]] ValueError ValueError -
10 Pass [10, '124'] TypeError TypeError -
11 Fail [-1, [1, 2]] ValueError TypeError amount must be a non-negative integer