Oliver Eyton-Williams ee1e8abd87

feat(curriculum): restore seed + solution to Chinese (#40683 )

* 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>

2021-01-12 19:31:00 -07:00

854 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f5131000cf542c510024	问题421：n15 +1的素因子	5		problem-421-prime-factors-of-n151

--description--

对于n> 1的每个整数，n15 +1形式的数字是合成的。

对于正整数n和m，将s（n，m）定义为不超过m的n15 +1个不同素数因子的总和。

例如 215 + 1 = 3×3×11×331。因此s（2.10）= 3且s（2,1000）= 3 + 11 + 331 = 345。

同样是1015 +1 = 7×11×13×211×241×2161×9091。因此s（10,100）= 31，而s（10,1000）= 483。求出∑ s（n，108）为1≤n≤1011。

--hints--

euler421()应该返回2304215802083466200。

assert.strictEqual(euler421(), 2304215802083466200);

--seed--

--seed-contents--

function euler421() {

  return true;
}

euler421();

--solutions--

// solution required

854 B Raw Blame History Unescape Escape