* 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>
812 B
812 B
id, title, challengeType, videoUrl, dashedName
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
5900f5331000cf542c510046 | 问题455:使用尾随数字的权力 | 5 | problem-455-powers-with-trailing-digits |
--description--
设f(n)是小于109的最大正整数x,使得nx的最后9位数字形成数字x(包括前导零),或者如果不存在这样的整数则为零。
例如:
f(4)= 411728896(4411728896 = ... 490411728896)f(10)= 0 f(157)= 743757(157743757 = ... 567000743757)Σf(n),2≤n≤103= 442530011399查找Σf(n ),2≤n≤106。
--hints--
euler455()
应该返回450186511399999。
assert.strictEqual(euler455(), 450186511399999);
--seed--
--seed-contents--
function euler455() {
return true;
}
euler455();
--solutions--
// solution required