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

740 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f3db1000cf542c50feed	问题110：丢番图互惠II	5		problem-110-diophantine-reciprocals-ii

--description--

在下面的等式中，x，y和n是正整数。 1 / x + 1 / y = 1 / n可以证实，当n = 1260时，存在113个不同的解，并且这是n的最小值，其中不同解的总数超过100。 n的最小值是多少，不同解决方案的数量超过四百万？

--hints--

diophantineTwo应该返回9350130049860600。

assert.strictEqual(diophantineTwo(), 9350130049860600);

--seed--

--seed-contents--

function diophantineTwo() {

  return true;
}

diophantineTwo();

--solutions--

// solution required

740 B Raw Blame History Unescape Escape