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

819 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f4ef1000cf542c510001	问题386：反链的最大长度	5		problem-386-maximum-length-of-an-antichain

--description--

令n为整数，S（n）为n的因子集。

如果A仅包含一个元素，或者如果A的元素中没有一个除以A的任何其他元素，则S（n）的子集A被称为S（n）的反共。

例如：S（30）= {1,2,3,5,6,10,15,30} {2,5,6}不是S（30）的反链。 {2,3,5}是S（30）的反链。

设N（n）为S（n）的反链的最大长度。

找ΣN（n）为1≤n≤108

--hints--

euler386()应该返回528755790。

assert.strictEqual(euler386(), 528755790);

--seed--

--seed-contents--

function euler386() {

  return true;
}

euler386();

--solutions--

// solution required

819 B Raw Blame History Unescape Escape