Cash denomination calculator

It minimizes the number of physical pieces rather than assuming a particular national currency or relying on the usual greedy change-making shortcut. Enter the amount and denomination values, including decimal coin values when needed. The result lists every supplied denomination with its required count, reports the total number of pieces, and clearly rejects totals that cannot be made exactly.

Enter the amount and the denominations you can use

Start with the total cash amount you need to assemble, then provide the available bill and coin values. The calculator is currency-neutral: values such as 20, 10, 5, 1, 0.25, and 0.10 work for a decimal currency, while a different set can represent vouchers, tokens, or a cash drawer with selected denominations missing. Amounts and denominations may use up to two decimal places, which keeps the calculation exact in the smallest cash unit rather than allowing floating-point drift. Each denomination must be positive and unique. The output sorts the supplied denominations from highest to lowest and includes a count for every one, including zero when a particular value is not needed. This makes the result straightforward to copy into a till sheet, packing list, withdrawal plan, or reconciliation record. The calculator assumes an unlimited supply of every listed denomination; the list describes which values exist, not how many individual pieces are currently in stock.

Why the result really uses the minimum number of pieces

Many everyday cash systems appear to support a simple rule: repeatedly take the largest denomination that does not exceed the remaining amount. That greedy shortcut is fast, but it is not correct for every denomination set. For example, unusual tokens, event coupons, foreign coins, or a drawer missing common values can make a smaller-first combination use fewer pieces than the greedy choice. This calculator uses dynamic programming instead. It evaluates reachable subtotals and records the smallest piece count that can produce each one, then reconstructs an exact combination for the requested total. Because all values are converted to integer minor units before calculation, comparisons are exact for the supported two-decimal inputs. If several combinations use the same minimum count, the deterministic search order favors larger denominations first, so repeated calls with the same input return the same breakdown. The computation is bounded to protect browser and API responsiveness; exceptionally fine denominations paired with a very large total may exceed the published normalized-work limit and will be rejected instead of running without a practical bound.

Understand exact-match failures and use the result safely

An exact result does not always exist. If every available denomination is a multiple of five cents, for instance, an amount ending in three cents cannot be assembled no matter how many pieces are used. The calculator reports that condition as an input error rather than returning a nearby amount, silently rounding the total, or inventing a denomination. That distinction matters in cash reconciliation, prepared change packs, and controlled payouts, where being slightly short or over is still wrong. A successful result returns the normalized amount, the minimum total number of pieces, and a denomination-by-denomination breakdown. Counts of zero remain visible so the output reflects the complete supplied set and can be aligned with an inventory form. Before acting on the plan, remember that the algorithm treats the supply of each denomination as unlimited. If your drawer has limited quantities, compare the proposed counts with the stock on hand; this capability does not solve the separate bounded-inventory problem. The same deterministic calculation runs in the browser for interactive use and through the API for automation at $0.002 per request.