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

816 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f4be1000cf542c50ffd0	问题337欧拉序列阶梯	5		problem-337-totient-stairstep-sequences

--description--

令{a1，a2，...，an}为长度为n的整数序列，使得：a1 = 6，对于所有1≤i<n：φ（ai）<φ（ai + 1）<ai <ai + 11令S（N）为具有≤N的这种序列的数目。例如，S（10）= 4：{6}，{6,8}，{6,8,9}和{6,10}。我们可以验证S（100）= 482073668和S（10 000）mod 108 = 73808307。

找到S（20 000 000）mod 108。

1φ表示欧拉的函数。

--hints--

euler337()应该返回85068035。

assert.strictEqual(euler337(), 85068035);

--seed--

--seed-contents--

function euler337() {

  return true;
}

euler337();

--solutions--

// solution required

816 B Raw Blame History Unescape Escape