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
739 B
Markdown
45 lines
739 B
Markdown
---
|
||
id: 5900f5231000cf542c510035
|
||
title: 问题439：除数之和
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-439-sum-of-sum-of-divisors
|
||
---
|
||
|
||
# --description--
|
||
|
||
令d（k）是k的所有除数之和。
|
||
|
||
我们定义函数S（N）= ∑1≤i≤N ∑1≤j≤Nd（i·j）。
|
||
|
||
例如，S（3）= d（1）+ d（2）+ d（3）+ d（2）+ d（4）+ d（6）+ d（3）+ d（6）+ d（ 9）= 59。
|
||
|
||
给出S（103）= 563576517282和S（105）mod 109 = 215766508。 找出S（1011）mod 109。
|
||
|
||
# --hints--
|
||
|
||
`euler439()`应该返回968697378。
|
||
|
||
```js
|
||
assert.strictEqual(euler439(), 968697378);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler439() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler439();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|