* 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>
691 B
691 B
id, title, challengeType, videoUrl, dashedName
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
5900f4771000cf542c50ff89 | 问题266:伪平方根 | 5 | problem-266-pseudo-square-root |
--description--
12的除数是:1,2,3,4,6和12. 12的最大除数不超过12的平方根是3.我们将称为整数n的最大除数,它不超过n的伪平方根(PSR)的平方根。可以看出PSR(3102)= 47。
设p是190以下质数的乘积。求PSR(p)mod 1016。
--hints--
euler266()
应该返回1096883702440585。
assert.strictEqual(euler266(), 1096883702440585);
--seed--
--seed-contents--
function euler266() {
return true;
}
euler266();
--solutions--
// solution required