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

764 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f4e41000cf542c50fff5	问题375：最小子序列	5		problem-375-minimum-of-subsequences

--description--

设Sn是由以下伪随机数发生器产生的整数序列：S0 = 290797 Sn + 1 = Sn2 mod 50515093

设A（i，j）是i≤j的数字Si，Si + 1，...，Sj中的最小值。设M（N）=ΣA（i，j）为1≤i≤j≤N。我们可以验证M（10）= 432256955和M（10 000）= 3264567774119。

找到M（2 000 000 000）。

--hints--

euler375()应该返回7435327983715286000。

assert.strictEqual(euler375(), 7435327983715286000);

--seed--

--seed-contents--

function euler375() {

  return true;
}

euler375();

--solutions--

// solution required

764 B Raw Blame History Unescape Escape