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

920 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f4421000cf542c50ff55	问题214个欧拉链	5		problem-214-totient-chains

--description--

设φ是欧拉的函数，即对于自然数n，φ（n）是k的数，1≤k≤n，gcd（k，n）= 1。

通过迭代φ，每个正整数产生以1结尾的数字递减的链。例如，如果我们从5开始，则生成序列5,4,2,1。以下列出了长度为4的所有链条：

5,4,2,1 7,6,2,1 8,4,2,1 9,6,2,1 10,4,2,1 12,4,2,1 14,6,2,1 18 ，6,2,1

这些链中只有两个以素数开头，它们的总和为12。

所有小于40000000的素数的总和是多少，它产生一个长度为25的链？

--hints--

euler214()应该返回1677366278943。

assert.strictEqual(euler214(), 1677366278943);

--seed--

--seed-contents--

function euler214() {

  return true;
}

euler214();

--solutions--

// solution required

920 B Raw Blame History Unescape Escape