chore(i8n,learn): processed translations

This commit is contained in:
Crowdin Bot
2021-02-06 04:42:36 +00:00
committed by Mrugesh Mohapatra
parent 15047f2d90
commit e5c44a3ae5
3274 changed files with 172122 additions and 14164 deletions

View File

@ -1,22 +1,22 @@
---
id: 5900f4fa1000cf542c51000d
title: 问题398切割绳索
title: 'Problem 398: Cutting rope'
challengeType: 5
videoUrl: ''
forumTopicId: 302063
dashedName: problem-398-cutting-rope
---
# --description--
在长度为n的绳索内放置n-1个点彼此之间的距离为1并且从端点开始。在这些点中我们随机选择m-1个点并在这些点处切断绳索以创建m个段。
Inside a rope of length n, n-1 points are placed with distance 1 from each other and from the endpoints. Among these points, we choose m-1 points at random and cut the rope at these points to create m segments.
设Enm为第二最短段的预期长度。例如E3,2= 2且E8,3= 16/7。注意如果多个段具有相同的最短长度则将第二最短段的长度定义为与最短长度相同。
Let E(n, m) be the expected length of the second-shortest segment. For example, E(3, 2) = 2 and E(8, 3) = 16/7. Note that if multiple segments have the same shortest length the length of the second-shortest segment is defined as the same as the shortest length.
找到E107,100。将您的答案四舍五入到小数点后面的小数点后5位。
Find E(107, 100). Give your answer rounded to 5 decimal places behind the decimal point.
# --hints--
`euler398()`应返回2010.59096
`euler398()` should return 2010.59096.
```js
assert.strictEqual(euler398(), 2010.59096);