* 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 |
---|---|---|---|---|
5900f5471000cf542c510059 | 问题474:除数的最后数字 | 5 | problem-474-last-digits-of-divisors |
--description--
对于正整数n和数字d,我们将F(n,d)定义为n的除数的数,其最后的数字等于d。例如,F(84,4)= 3.在84的除数中(1,2,3,4,6,7,12,14,21,28,42,84),其中三个(4,14) ,84)有最后一位数字4。
我们还可以验证F(12!,12)= 11和F(50!,123)= 17888。
找到F(106!,65432)modulo(1016 + 61)。
--hints--
euler474()
应该返回9690646731515010。
assert.strictEqual(euler474(), 9690646731515010);
--seed--
--seed-contents--
function euler474() {
return true;
}
euler474();
--solutions--
// solution required