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

981 B
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f39f1000cf542c50feb2 问题51主要数字替换 5 problem-51-prime-digit-replacements

--description--

通过替换2位数* 3的第1位可以看出9个可能值中的6个13,23,43,53,73和83都是素数。通过用相同的数字替换56 ** 3的第3和第4位数字这个5位数字是在10个生成的数字中具有7个素数的第一个例子产生该族56003,56113,56333,56443,56663,56773因此56003作为这个家族的第一个成员是拥有这个属性的最小的素数。找到最小的素数通过用相同的数字替换部分数字不一定是相邻的数字它是8个素数值族的一部分。

--hints--

euler51()应返回121313。

assert.strictEqual(euler51(), 121313);

--seed--

--seed-contents--

function primeDigitReplacements() {

  return true;
}

primeDigitReplacements();

--solutions--

// solution required