65 lines
1014 B
Markdown
65 lines
1014 B
Markdown
---
|
||
id: 5900f4a01000cf542c50ffb2
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
title: 问题307：芯片缺陷
|
||
---
|
||
|
||
## Description
|
||
<section id="description">
|
||
k个缺陷随机分布在一家工厂生产的n个集成电路芯片中（在芯片上可以发现任何数量的缺陷，每个缺陷与其他缺陷无关）。
|
||
|
||
|
||
令p（k，n）表示存在至少3个缺陷的芯片的概率。
|
||
例如p（3.7）≈0.0204081633。
|
||
|
||
|
||
找到p（20,000，1 000 000）并以0.abcdefghij的形式将答案四舍五入到小数点后10位。
|
||
</section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## 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'>
|
||
|
||
```js
|
||
function euler307() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler307();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|