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

850 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f4621000cf542c50ff74	问题245：Coresilience	5		problem-245-coresilience

--description--

我们将称一个无法取消弹性部分的分数。此外，我们将分母R（d）的弹性定义为具有弹性的适当分数的比率;例如，R（12）= 4/11。

数d> 1的弹性则为φ（d）d-1，其中φ是欧拉的函数。我们进一步定义了n> 1的核心，即C（n）= n - φ（n）n - 1.素数p的核心是C（p）= 1p - 1.找出所有复合整数的总和1 <n≤2×1011，其中C（n）是单位分数。

--hints--

euler245()应该返回288084712410001。

assert.strictEqual(euler245(), 288084712410001);

--seed--

--seed-contents--

function euler245() {

  return true;
}

euler245();

--solutions--

// solution required

850 B Raw Blame History Unescape Escape