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

1.2 KiB
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f4231000cf542c50ff36 问题183零件的最大产品 5 problem-183-maximum-product-of-parts

--description--

令N为正整数并且将N分成k个相等的部分r = N / k使得N = r + r + ... + r。设P是这些部分的乘积P = r×r×...×r = rk。

例如如果11被分成五个相等的部分11 = 2.2 + 2.2 + 2.2 + 2.2 + 2.2那么P = 2.25 = 51.53632。

对于给定的N值设MN= Pmax。

事实证明N = 11的最大值是通过将11分成4个相等的部分得到的这导致Pmax =11/44;即M11= 14641/256 = 57.19140625,这是终止小数。

然而对于N = 8通过将其分成三个相等的部分来实现最大值因此M8= 512/27这是非终止小数。

如果MN是非终止小数则令DN= N如果MN是终止小数则DN= -N。

例如5≤N≤100的ΣDN是2438。

求ΣDN为5≤N≤10000。

--hints--

euler183()应该返回48861552。

assert.strictEqual(euler183(), 48861552);

--seed--

--seed-contents--

function euler183() {

  return true;
}

euler183();

--solutions--

// solution required