56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
|
---
|
|||
|
id: 5900f4fa1000cf542c51000d
|
|||
|
challengeType: 5
|
|||
|
title: 'Problem 398: Cutting rope'
|
|||
|
videoUrl: ''
|
|||
|
localeTitle: 问题398:切割绳索
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id="description">在长度为n的绳索内,放置n-1个点,彼此之间的距离为1,并且从端点开始。在这些点中,我们随机选择m-1个点并在这些点处切断绳索以创建m个段。 <p>设E(n,m)为第二最短段的预期长度。例如,E(3,2)= 2且E(8,3)= 16/7。注意,如果多个段具有相同的最短长度,则将第二最短段的长度定义为与最短长度相同。 </p><p>找到E(107,100)。将您的答案四舍五入到小数点后面的小数点后5位。 </p></section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id="instructions">
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler398()</code>应返回2010.59096。
|
|||
|
testString: 'assert.strictEqual(euler398(), 2010.59096, "<code>euler398()</code> should return 2010.59096.");'
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler398() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler398();
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
</section>
|