Files
freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.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

63 lines
1009 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: 5900f5231000cf542c510035
challengeType: 5
title: 'Problem 439: Sum of sum of divisors'
videoUrl: ''
localeTitle: 问题439除数之和
---
## Description
<section id="description">
令dk是k的所有除数之和。
我们定义函数SN= ∑1≤i≤N ∑1≤j≤Ndi·j
例如S3= d1+ d2+ d3+ d2+ d4+ d6+ d3+ d6+ d 9= 59。
给出S103= 563576517282和S105mod 109 = 215766508。
找出S1011mod 109。
</section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler439()</code>应该返回968697378。
testString: assert.strictEqual(euler439(), 968697378);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler439() {
// Good luck!
return true;
}
euler439();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>