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

872 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f4c71000cf542c50ffd8	问题346：强大的Repunits	5		problem-346-strong-repunits

--description--

数字7是特殊的，因为7是用基数2写的111，用基数6写的是11（即710 = 116 = 1112）。换句话说，7是至少两个碱基b> 1的重新排列。

我们将调用一个正整数，该属性是一个强大的repunit。可以证实，在50以下有8个强大的重新命令：{1,7,13,15,21,31,40,43}。此外，1000以下的所有强大的重新命令的总和等于15864。

找出1012以下所有强大的回购总和。

--hints--

euler346()应该返回336108797689259260。

assert.strictEqual(euler346(), 336108797689259260);

--seed--

--seed-contents--

function euler346() {

  return true;
}

euler346();

--solutions--

// solution required

872 B Raw Blame History Unescape Escape