Connection
Base URL, credentials and a reachable server.
Product
Product features · Largest-remainder allocation
01
QuotaMosaic gives quota-allocation code a concrete review target: integer floors first, then remaining seats assigned by remainders with explicit tie order.
Selection
A model available through the configured endpoint.
Capabilities
Context limits and tool support are determined by the model and server.
Largest-remainder allocation
● ● ●QuotaMosaic●
A concrete starting point · Largest-remainder allocation ×
def allocate(weights, seats):
if type(weights) not in (list, tuple) or len(weights) > 1000:
raise ValueError("weights.container")
weights = tuple(weights)
if type(seats) is not int or not 0 <= seats <= 10000:
raise ValueError("seats.range")
if len(weights) > 1000 or any(type(w) is not int or w < 0 for w in weights):
raise ValueError("weights.invalid")
total = sum(weights)
if total == 0:
if seats:
raise ValueError("weight.zero")
return [0] * len(weights)
result = [w * seats // total for w in weights]
remaining = seats - sum(result)
order = sorted(range(len(weights)), key=lambda i: (-(weights[i] * seats % total), i))
for i in order[:remaining]:
result[i] += 1
return result✳Allocate up to 10000 integer seats across at most 1000 nonnegative integer weights using largest remainders.
✓ ChangesReview before applying ↗
Illustrative workspace