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

897 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f4711000cf542c50ff84	问题261：Pivotal Square Sums	5		problem-261-pivotal-square-sums

--description--

如果存在一对m> 0且n≥k的整数，则让我们称正整数ka square-pivot，使得直到k的（m + 1）个连续正方形的总和等于m个连续正方形的总和从（n + 1）开始：

（km）2 + ... + k2 =（n + 1）2 + ... +（n + m）2。

一些小的方形枢轴是4：32 + 42 = 52 21：202 + 212 = 292 24：212 + 222 + 232 + 242 = 252 + 262 + 272 110：1082 + 1092 + 1102 = 1332 + 1342找到所有的总和不同的方形枢轴≤1010。

--hints--

euler261()应该返回238890850232021。

assert.strictEqual(euler261(), 238890850232021);

--seed--

--seed-contents--

function euler261() {

  return true;
}

euler261();

--solutions--

// solution required

897 B Raw Blame History Unescape Escape