freeCodeCamp/problem-53-combinatoric-selections.chinese.md at 01b4fe6b26120d4aaf58f0b8402e3a35c5f99c20

Files

Beau Carnes 2ca3a2093f Add languages Russian, Arabic, Chinese, Portuguese (#18305 )

2018-10-11 03:33:03 +05:30

1.8 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3a11000cf542c50feb4	5	Problem 53: Combinatoric selections		问题53：组合选择

Description

有十种方法从五种中选择三种，12345：123,124,125,134,135,145,234,235,245和345在组合学中，我们使用符号，5C3 = 10.一般来说，

nCr = n！r！（n-r）！，其中r≤n，n！ = n×（n-1）×...×3×2×1和0！ = 1。

直到n = 23，一个值超过一百万：23C10 = 1144066.对于1≤n≤100，nCr的多少，不一定是不同的值大于一百万？

Instructions

Tests

tests:
  - text: <code>combinatoricSelections(1000)</code>应返回4626。
    testString: 'assert.strictEqual(combinatoricSelections(1000), 4626, "<code>combinatoricSelections(1000)</code> should return 4626.");'
  - text: <code>combinatoricSelections(10000)</code>应该返回4431。
    testString: 'assert.strictEqual(combinatoricSelections(10000), 4431, "<code>combinatoricSelections(10000)</code> should return 4431.");'
  - text: <code>combinatoricSelections(100000)</code>应返回4255。
    testString: 'assert.strictEqual(combinatoricSelections(100000), 4255, "<code>combinatoricSelections(100000)</code> should return 4255.");'
  - text: <code>combinatoricSelections(1000000)</code>应该返回4075。
    testString: 'assert.strictEqual(combinatoricSelections(1000000), 4075, "<code>combinatoricSelections(1000000)</code> should return 4075.");'

Challenge Seed

function combinatoricSelections(limit) {
  // Good luck!
  return 1;
}

combinatoricSelections(1000000);

Solution

// solution required

1.8 KiB Raw Blame History Unescape Escape