freeCodeCamp/problem-439-sum-of-sum-of-divisors.chinese.md at 3ee1c39e41c1aae3b0b23b3e79fba3ec1aae1989

Files

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

1009 B

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f5231000cf542c510035	5	Problem 439: Sum of sum of divisors		问题439：除数之和

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。

Instructions

Tests

tests:
  - text: <code>euler439()</code>应该返回968697378。
    testString: assert.strictEqual(euler439(), 968697378);

Challenge Seed

function euler439() {
  // Good luck!
  return true;
}

euler439();

Solution

// solution required

1009 B Raw Blame History Unescape Escape