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

683 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f47b1000cf542c50ff8d	问题271：模块化立方体，第1部分	5		problem-271-modular-cubes-part-1

--description--

对于正数n，将S（n）定义为整数x的总和，为1

当n = 91时，x有8个可能的值，即：9,16,22,29,53,74,79,81。因此，S（91）= 9 + 16 + 22 + 29 + 53 + 74 + 79 + 81 = 363。

找到S（13082761331670030）。

--hints--

euler271()应返回4617456485273130000。

assert.strictEqual(euler271(), 4617456485273130000);

--seed--

--seed-contents--

function euler271() {

  return true;
}

euler271();

--solutions--

// solution required

683 B Raw Blame History Unescape Escape