List combinations
Treat every line as an element and list all of its combinations (order does not matter) — a fixed size, or every size from 1 up to all items. To keep the page alive, input is capped at 12 items and output at 20,000 combinations.
Runs in your browserEvery computation happens in your browser — your data never leaves this device.
Combinations
One combination per line, 20,000 lines max.
Paste a list to list every combination
Items: 0 · Combinations: 0 · Longest group: 0 · Result limit: 0
What this tool does
- Pairing people up: list every two-person combination for shifts, matches or interviews.
- Test coverage: enumerate every combination of options to see which pairs are still untested.
- Bundle ideas: combine products two at a time to review possible package deals.
Example
Input
apple banana cherry
Output
apple,banana apple,cherry banana,cherry
C(3,2) = 3 combinations: apple+banana, apple+cherry, banana+cherry — order is ignored.
Frequently asked questions
How many combinations can it handle?
Input is capped at 12 items and output at 20,000 combinations; exceeding either raises `input-too-large`. Counts grow like C(n,r): 12 choose 6 is 924 and all lengths together are 4,095, while all combinations of 20 items run into the millions — too slow for a tab, so it is refused up front.
How is this different from permutations?
Combinations ignore order, so a,b and b,a are the same group; permutations treat them as two results. Use the list permutation tool when order matters.
What does size 0 mean?
List every length from 1 up to all n items, shortest first and in input order within a length. A concrete number (e.g. 2) outputs only that length.
What if my result count exceeds the limit?
Lowering the limit will not truncate anything — the cap exists to stop explosions, so it errors out instead of quietly returning half the results. Reduce the number of items or split the list into batches.
Keywords：列表全组合组合combinationC(n,r)组合枚举所有组合排列组合子集