ee1e8abd87
* 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>
39 lines
608 B
Markdown
39 lines
608 B
Markdown
---
|
||
id: 5900f43f1000cf542c50ff52
|
||
title: 问题211：除数平方和
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-211-divisor-square-sum
|
||
---
|
||
|
||
# --description--
|
||
|
||
对于正整数n，令σ2（n）为其除数的平方和。例如，σ2（10）= 1 + 4 + 25 + 100 = 130.找到所有n的总和，0 <n <64,000,000，使得σ2（n）是完美的平方。
|
||
|
||
# --hints--
|
||
|
||
`euler211()`应返回1922364685。
|
||
|
||
```js
|
||
assert.strictEqual(euler211(), 1922364685);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler211() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler211();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|