freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-53-combinatoric-sel...

62 lines
1.8 KiB
Markdown
Raw Normal View History

---
id: 5900f3a11000cf542c50feb4
challengeType: 5
title: 'Problem 53: Combinatoric selections'
videoUrl: ''
localeTitle: 问题53组合选择
---
## Description
<section id="description">有十种方法从五种中选择三种12345123,124,125,134,135,145,234,235,245和345在组合学中我们使用符号5C3 = 10.一般来说, <p> nCr = nrn-r 其中r≤nn = n×n-1×...×3×2×1和0 = 1。 </p><p>直到n = 23一个值超过一百万23C10 = 1144066.对于1≤n≤100nCr的多少不一定是不同的值大于一百万 </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
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.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function combinatoricSelections(limit) {
// Good luck!
return 1;
}
combinatoricSelections(1000000);
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>