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

638 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f3fe1000cf542c50ff11	问题146：调查素数模式	5		problem-146-investigating-a-prime-pattern

--description--

整数n2 + 1，n2 + 3，n2 + 7，n2 + 9，n2 + 13和n2 + 27为其连续质数的最小正整数n为10。所有小于100万的整数n的总和是1242490。

所有小于1.5亿的整数n的总和是多少？

--hints--

euler146()应该返回676333270。

assert.strictEqual(euler146(), 676333270);

--seed--

--seed-contents--

function euler146() {

  return true;
}

euler146();

--solutions--

// solution required

638 B Raw Blame History Unescape Escape