56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f45c1000cf542c50ff6e
|
||
challengeType: 5
|
||
title: 'Problem 239: Twenty-two Foolish Primes'
|
||
videoUrl: ''
|
||
localeTitle: 问题239：二十二个愚蠢的素数
|
||
---
|
||
|
||
## Description
|
||
<section id="description">编号为1到100的一组磁盘以随机顺序排列成一行。 <p>我们有一个部分紊乱的概率是多少，这样才能确定22个素数盘远离它们的自然位置？ （任何数量的非主要磁盘也可以在其自然位置内或外找到。） </p><p>将答案四舍五入到小数点后面的12位，格式为0.abcdefghijkl。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler239()</code>应该返回0.001887854841。
|
||
testString: 'assert.strictEqual(euler239(), 0.001887854841, "<code>euler239()</code> should return 0.001887854841.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler239() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler239();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|