* 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>
652 B
652 B
id, title, challengeType, videoUrl, dashedName
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
5900f3f11000cf542c50ff03 | 问题132:大的重新安置因素 | 5 | problem-132-large-repunit-factors |
--description--
完全由1组成的数字称为repunit。我们将R(k)定义为长度k的重新定位。例如,R(10)= 1111111111 = 11×41×271×9091,并且这些素因子的总和是9414.求出R(109)的前40个素因子的总和。
--hints--
euler132()
应返回843296。
assert.strictEqual(euler132(), 843296);
--seed--
--seed-contents--
function euler132() {
return true;
}
euler132();
--solutions--
// solution required