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>
45 lines
748 B
Markdown
45 lines
748 B
Markdown
---
|
||
id: 5900f4fd1000cf542c51000f
|
||
title: 问题401：除数的平方和
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-401-sum-of-squares-of-divisors
|
||
---
|
||
|
||
# --description--
|
||
|
||
6的除数是1,2,3和6.这些数的平方和是1 + 4 + 9 + 36 = 50。
|
||
|
||
设sigma2（n）代表n的除数的平方和。因此sigma2（6）= 50。
|
||
|
||
设SIGMA2表示sigma2的和函数，即对于i = 1到n，SIGMA2（n）=Σsigma2（i）。 SIGMA2的前6个值是：1,6,16,37,63和113。
|
||
|
||
找到SIGMA2（1015）modulo 109。
|
||
|
||
# --hints--
|
||
|
||
`euler401()`应该返回281632621。
|
||
|
||
```js
|
||
assert.strictEqual(euler401(), 281632621);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler401() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler401();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|