freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
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

728 B
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f5191000cf542c51002c 问题429单一除数的平方和 5 problem-429-sum-of-squares-of-unitary-divisors

--description--

数为n的unit除数d是n的除数其性质为gcddn / d= 1。

4的除数 = 24是1、3、8和24。

它们的平方和是12 + 32 + 82 + 242 = 650。

令Sn表示n的一元除数的平方和。 因此S4 650。

求S100000000取模1000000009。

--hints--

euler429()应该返回98792821。

assert.strictEqual(euler429(), 98792821);

--seed--

--seed-contents--

function euler429() {

  return true;
}

euler429();

--solutions--

// solution required