排列组合计算器 — Uttir
Skip to main content

排列组合计算器

计算 nPr 和 nCr,可选择列出全部排列或子集。超大数值时自动限制范围。

排列组合计算器 — Permutations and combinations are the two basic ways of counting selections from a set. A permutation is an ordered arrangement — picking 1st, 2nd, 3rd place. A combination is an unordered subset — picking a committee of three.

All calculations run locally in your browser. Nothing is uploaded — close the tab and the data is gone.

Was 排列组合计算器 useful?

排列组合计算器是什么?

Permutations and combinations are the two basic ways of counting selections from a set. A permutation is an ordered arrangement — picking 1st, 2nd, 3rd place. A combination is an unordered subset — picking a committee of three.

This tool computes nPr and nCr instantly, formats the result with sensible magnitude (3.7 million, 1.2 × 10²⁴, etc.), and — for small enough values — lists every arrangement or subset so you can see the pattern.

使用方法

  1. Enter n and r

    n is the total set size, r is how many you pick.

  2. Pick permutation or combination

    Permutation counts order, combination does not.

  3. Optionally list the values

    Enter items as a comma-separated list, then click List to enumerate.

示例

Lottery odds

6 numbers from 49, order does not matter.

n = 49, r = 6, combination

结果: 13,983,816 (≈ 14 million)

Race podium

1st, 2nd, 3rd from 8 runners, order matters.

n = 8, r = 3, permutation

结果: 336 (8 × 7 × 6)

常见问题

相关指南

相关工具

Last reviewed: 2026-11-21