Oliver Eyton-Williams ee1e8abd87

feat(curriculum): restore seed + solution to Chinese (#40683 )

* 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>

2021-01-12 19:31:00 -07:00

906 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f4fa1000cf542c51000d	问题398：切割绳索	5		problem-398-cutting-rope

--description--

在长度为n的绳索内，放置n-1个点，彼此之间的距离为1，并且从端点开始。在这些点中，我们随机选择m-1个点并在这些点处切断绳索以创建m个段。

设E（n，m）为第二最短段的预期长度。例如，E（3,2）= 2且E（8,3）= 16/7。注意，如果多个段具有相同的最短长度，则将第二最短段的长度定义为与最短长度相同。

找到E（107,100）。将您的答案四舍五入到小数点后面的小数点后5位。

--hints--

euler398()应返回2010.59096。

assert.strictEqual(euler398(), 2010.59096);

--seed--

--seed-contents--

function euler398() {

  return true;
}

euler398();

--solutions--

// solution required

906 B Raw Blame History Unescape Escape