Unbounded Knapsack in C

#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <limits.h>
#include <errno.h>
// Unbounded Knapsack in C
//
// PURPOSE
// Unbounded knapsack maximizes value under a capacity limit while allowing unlimited copies
// of each item.
//
// METHOD
// Process each item and scan capacities upward, allowing the current item to extend states
// already improved by another copy of itself.
//
// COMPLEXITY
// O(n * capacity) time, O(capacity) space; pseudo-polynomial.
//
// CONTRACT
// Positive weights, nonnegative values, capacity >=0. Arrays have matching lengths. Returns
// best value, which must fit signed 32-bit.
// Public APIs infer array lengths except in C, which accepts pointer/length pairs. Vertex
// counts and matrix dimensions remain explicit. Arrays must contain signed 32-bit integers.
// Sorted order, correct tree topology, and caller-owned data-structure invariants are
// preconditions; checking them on every query would change query complexity.
// Scalar and shape checks are included. Value-range checks are included where needed to
// prevent invalid indexing or nontermination. Allocation sizes are capped at 4,000,000
// workspace entries. Arithmetic outside Python raises an error on 32-bit overflow; Python
// uses arbitrary precision. Native allocation failures propagate. In-place outputs may be
// partly updated after arithmetic failure. These are single-threaded, in-memory
// implementations.
//
// LANGUAGE DETAILS
// C99: checked calloc/free workspace, const input pointers, explicit size_t lengths. Errors
// return INT_MIN with errno=EINVAL, ERANGE, or ENOMEM. Check errno before using a result.
// Input/output arrays must not alias. No variable-length stack arrays.
//
// EXAMPLE
// Expected return: 13.
// Run: gcc -std=c99 -O2 example.c -o example && ./example
// Tests for this exact source artifact run before publication. The accompanying source
// archive includes unit cases, runtime results, and source hashes.

static int alg_min(int a, int b) { return a < b ? a : b; }
static int alg_max(int a, int b) { return a > b ? a : b; }
static int alg_checked(int64_t v, int *error) {
    if (v < INT_MIN || v > INT_MAX) { *error = 1; return 0; }
    return (int)v;
}
static int alg_add(int a, int b, int *e) { return alg_checked((int64_t)a+b,e); }
static int alg_sub(int a, int b, int *e) { return alg_checked((int64_t)a-b,e); }
static int alg_mul(int a, int b, int *e) { return alg_checked((int64_t)a*b,e); }

int unbounded_knapsack(const int *weights, size_t weights_length, const int *values, size_t values_length, int capacity) {
    int alg_error = 0;
    int alg_result = INT_MIN;
    errno = 0;
    int *dp = NULL;
    if (weights_length > 1000000 || (weights_length && !weights)) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (values_length > 1000000 || (values_length && !values)) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    int n = (int)weights_length;
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    if (!(((n >= 0) && (n <= 1000000)))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    if (!(((int)weights_length == n))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    if (!(((int)values_length == n))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    if (!(((capacity >= 0) && (capacity <= 1000000)))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    for (int alg_i = 0; alg_i < (int)weights_length; alg_i++) {
        int alg_value = weights[alg_i];
        if (!((alg_value > 0))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
        if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    }
    for (int alg_i = 0; alg_i < (int)values_length; alg_i++) {
        int alg_value = values[alg_i];
        if (!((alg_value >= 0))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
        if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    }
    {
        int alg_length = alg_add(capacity, 1, &alg_error);
        if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
        if (alg_length < 0 || alg_length > 4000000) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
        dp = calloc((size_t)(alg_length ? alg_length : 1), sizeof(*dp));
        if (!dp) { errno = ENOMEM; alg_result = INT_MIN; goto alg_cleanup; }
    }
    int i = 0;
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    int c = 0;
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    while (1) {
        int alg_condition = (i < n);
        if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
        if (!alg_condition) break;
        c = weights[i];
        if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
        while (1) {
            int alg_condition = (c <= capacity);
            if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
            if (!alg_condition) break;
            dp[c] = alg_max(dp[c], alg_add(dp[alg_sub(c, weights[i], &alg_error)], values[i], &alg_error));
            if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
            c = alg_add(c, 1, &alg_error);
            if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
        }
        i = alg_add(i, 1, &alg_error);
        if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    }
    alg_result = dp[capacity];
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    goto alg_cleanup;
alg_cleanup:
    free(dp);
    return alg_result;
}

int main(void) {
    int weights[] = {2, 3};
    int values[] = {4, 5};
    int capacity = 7;
    int result = unbounded_knapsack(weights, 2, values, 2, capacity);
    printf("%d\n", result);
    if (errno) { perror("algorithm"); return 1; }
    return 0;
}