* 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>
665 B
665 B
id, title, challengeType, videoUrl, dashedName
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
5900f42b1000cf542c50ff3d | 问题190:最大化加权产品 | 5 | problem-190-maximising-a-weighted-product |
--description--
令Sm =(x1,x2,...,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