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

808 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f3c81000cf542c50fedb	问题92：方形数字链	5		problem-92-square-digit-chains

--description--

通过在数字中连续添加数字的平方来创建数字链，以形成新的数字，直到之前看到它为止。例如，44→32→13→10→1→1 85→89→145→42→20→4→16→37→58→89因此，任何到达1或89的链条都会卡在无限循环中。最令人惊讶的是，每个起始号码最终都会达到1或89.低于一千万的起始号码将达到89个？

--hints--

euler92()应返回8581146。

assert.strictEqual(euler92(), 8581146);

--seed--

--seed-contents--

function squareDigitChains() {

  return true;
}

squareDigitChains();

--solutions--

// solution required

808 B Raw Blame History Unescape Escape