56 lines
934 B
Markdown
56 lines
934 B
Markdown
---
|
||
id: 5900f43f1000cf542c50ff52
|
||
challengeType: 5
|
||
title: 'Problem 211: Divisor Square Sum'
|
||
videoUrl: ''
|
||
localeTitle: 问题211：除数平方和
|
||
---
|
||
|
||
## Description
|
||
<section id="description">对于正整数n，令σ2（n）为其除数的平方和。例如，σ2（10）= 1 + 4 + 25 + 100 = 130.找到所有n的总和，0 <n <64,000,000，使得σ2（n）是完美的平方。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler211()</code>应返回1922364685。
|
||
testString: 'assert.strictEqual(euler211(), 1922364685, "<code>euler211()</code> should return 1922364685.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler211() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler211();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|