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

737 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f4f11000cf542c510002	问题388：不同的线条	5		problem-388-distinct-lines

--description--

考虑所有格点（a，b，c），其中0≤a，b，c≤N。

从原点O（0,0,0）开始，所有线都被绘制到其他格点。设D（N）是不同的这种线的数量。

您被给予D（1 000 000）= 831909254469114121。

找到D（1010）。将前9位数字后跟最后9位数字作为答案。

--hints--

euler388()应该返回831907372805130000。

assert.strictEqual(euler388(), 831907372805130000);

--seed--

--seed-contents--

function euler388() {

  return true;
}

euler388();

--solutions--

// solution required

737 B Raw Blame History Unescape Escape