* 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>
786 B
786 B
id, title, challengeType, videoUrl, dashedName
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
5900f50f1000cf542c510021 | 问题418:三重分解 | 5 | problem-418-factorisation-triples |
--description--
令n为正整数。 在以下情况下,整数三元组(a,b,c)称为n的分解三元组:
a·b·c = n。
将f(n)定义为n的因式分解三元组(a,b,c)的a + b + c,使c / a最小。 可以证明这一三元组是独特的。
例如,f(165)= 19,f(100100)= 142,f(20!)= 4034872。
查找f(43!)。
--hints--
euler418()
应该返回1177163565297340400。
assert.strictEqual(euler418(), 1177163565297340400);
--seed--
--seed-contents--
function euler418() {
return true;
}
euler418();
--solutions--
// solution required