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

653 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f4d01000cf542c50ffe2	问题355：最大互质子集	5		problem-355-maximal-coprime-subset

--description--

将Co（n）定义为来自{1,2，...，n}的一组相互共元素的最大可能和。例如，Co（10）是30并且在子集{1,5,7,8,9}上达到最大值。

给出Co（30）= 193和Co（100）= 1356。

找到Co（200000）。

--hints--

euler355()应返回1726545007。

assert.strictEqual(euler355(), 1726545007);

--seed--

--seed-contents--

function euler355() {

  return true;
}

euler355();

--solutions--

// solution required

653 B Raw Blame History Unescape Escape