freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md
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

665 B
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f42b1000cf542c50ff3d 问题190最大化加权产品 5 problem-190-maximising-a-weighted-product

--description--

令Sm =x1x2...xm为正实数的m元组其中x1 + x2 + ... + xm = m其中Pm = x1 * x22 * ... * xmm最大化。

例如,可以验证[P10] = 4112[]是整数部分函数)。

求Σ[Pm]为2≤m≤15。

--hints--

euler190()应该返回371048281。

assert.strictEqual(euler190(), 371048281);

--seed--

--seed-contents--

function euler190() {

  return true;
}

euler190();

--solutions--

// solution required