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

759 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f52c1000cf542c51003f	问题448：平均最小公倍数	5		problem-448-average-least-common-multiple

--description--

函数lcm（a，b）表示a和b的最小公倍数。设A（n）为1≤i≤n的lcm（n，i）的平均值。例如：A（2）=（2 + 2）/ 2 = 2且A（10）=（10 + 10 + 30 + 20 + 10 + 30 + 70 + 40 + 90 + 10）/ 10 = 32。

令S（n）=ΣA（k）为1≤k≤n。 S（100）= 122726。

找到S（99999999019）mod 999999017。

--hints--

euler448()应该返回106467648。

assert.strictEqual(euler448(), 106467648);

--seed--

--seed-contents--

function euler448() {

  return true;
}

euler448();

--solutions--

// solution required

759 B Raw Blame History Unescape Escape