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

652 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f5331000cf542c510045	问题454：丢番图倒数III	5		problem-454-diophantine-reciprocals-iii

--description--

在下面的等式中，x，y和n是正整数。

1x + 1y = 1n

对于极限L，我们将F（L）定义为满足x <y≤L的解的数量。

我们可以验证F（15）= 4和F（1000）= 1069.找到F（1012）。

--hints--

euler454()应该返回5435004633092。

assert.strictEqual(euler454(), 5435004633092);

--seed--

--seed-contents--

function euler454() {

  return true;
}

euler454();

--solutions--

// solution required

652 B Raw Blame History Unescape Escape