Files
freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-211-divisor-square-sum.chinese.md
Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220)
* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions
2020-03-03 18:49:47 +05:30

56 lines
879 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f43f1000cf542c50ff52
challengeType: 5
title: 'Problem 211: Divisor Square Sum'
videoUrl: ''
localeTitle: 问题211除数平方和
---
## Description
<section id="description">对于正整数nσ2n为其除数的平方和。例如σ210= 1 + 4 + 25 + 100 = 130.找到所有n的总和0 &lt;n &lt;64,000,000使得σ2n是完美的平方。 </section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler211()</code>应返回1922364685。
testString: assert.strictEqual(euler211(), 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>