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

762 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f5361000cf542c510049	问题458：项目的排列	5		problem-458-permutations-of-project

--description--

考虑由“项目”一词的字母组成的字母A：A = {c，e，j，o，p，r，t}。令T（n）为长度为n的字符串数，该字符串由来自A的字母组成，其中没有子字符串，该子字符串是“项目”的5040个排列之一。

T（7）= 77-7！= 818503。

找到T（1012）。给出答案的最后9位数字。

--hints--

euler458()应该返回423341841。

assert.strictEqual(euler458(), 423341841);

--seed--

--seed-contents--

function euler458() {

  return true;
}

euler458();

--solutions--

// solution required

762 B Raw Blame History Unescape Escape