* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
43 lines
781 B
Markdown
43 lines
781 B
Markdown
---
|
||
id: 5900f4a01000cf542c50ffb2
|
||
title: 问题307:芯片缺陷
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-307-chip-defects
|
||
---
|
||
|
||
# --description--
|
||
|
||
k个缺陷随机分布在一家工厂生产的n个集成电路芯片中(在芯片上可以发现任何数量的缺陷,每个缺陷与其他缺陷无关)。
|
||
|
||
令p(k,n)表示存在至少3个缺陷的芯片的概率。 例如p(3.7)≈0.0204081633。
|
||
|
||
找到p(20,000,1 000 000)并以0.abcdefghij的形式将答案四舍五入到小数点后10位。
|
||
|
||
# --hints--
|
||
|
||
`euler307()`应该返回0.7311720251。
|
||
|
||
```js
|
||
assert.strictEqual(euler307(), 0.7311720251);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler307() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler307();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|