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

993 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f3f91000cf542c50ff0b	问题141：调查渐进数n，它们也是正方形	5		problem-141-investigating-progressive-numbers-n-which-are-also-square

--description--

正整数n除以d，商和余数分别为q和r。另外，d，q和r是几何序列中的连续正整数项，但不一定是该顺序。例如，58除以6具有商9和余数4.还可以看出，4,6,9是几何序列中的连续项（公共比率3/2）。我们将这样的数字称为n，进步。一些渐进的数字，例如9和10404 = 1022，恰好也是完美的正方形。所有渐进完美正方形的总和低于十万是124657.找到所有渐进完美正方形的总和低于一万亿（1012）。

--hints--

euler141()应该返回878454337159。

assert.strictEqual(euler141(), 878454337159);

--seed--

--seed-contents--

function euler141() {

  return true;
}

euler141();

--solutions--

// solution required

993 B Raw Blame History Unescape Escape