gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(learn): Applied MDX format to Chinese curriculum files (#40462)

Browse Source
This commit is contained in:
Randell Dawson
2020-12-16 00:37:30 -07:00
committed by GitHub
parent 873fce02a2
commit 9ce4a02a41
1665 changed files with 58741 additions and 88042 deletions
Download Patch File Download Diff File Expand all files Collapse all files

55
curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
View File

@ -1,64 +1,25 @@
---
id: 5900f4a01000cf542c50ffb2
title: 问题307：芯片缺陷
challengeType: 5
videoUrl: ''
title: 问题307：芯片缺陷
---
## Description
<section id="description">
# --description--
k个缺陷随机分布在一家工厂生产的n个集成电路芯片中（在芯片上可以发现任何数量的缺陷，每个缺陷与其他缺陷无关）。
令p（k，n）表示存在至少3个缺陷的芯片的概率。
例如p（3.7）≈0.0204081633。
令p（k，n）表示存在至少3个缺陷的芯片的概率。 例如p（3.7）≈0.0204081633。
找到p（20,000，1 000 000）并以0.abcdefghij的形式将答案四舍五入到小数点后10位。
</section>
## Instructions
<section id="instructions">
</section>
# --hints--
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler307()</code>应该返回0.7311720251。
testString: assert.strictEqual(euler307(), 0.7311720251);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
`euler307()`应该返回0.7311720251。
```js
function euler307() {
// Good luck!
return true;
}
euler307();
assert.strictEqual(euler307(), 0.7311720251);
```
</div>
# --solutions--
</section>
## Solution
<section id='solution'>
```js
// solution required
```
/section>