gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
Files
be4070a73dbc05eb4d4dbfef6dbdaee16e0b34a9
freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-10-summation-of-primes.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

1.2 KiB
Raw Blame History

id, challengeType, title, videoUrl, localeTitle
id challengeType title videoUrl localeTitle
5900f3761000cf542c50fe89 5 Problem 10: Summation of primes 问题10：素数的总和

Description

低于10的素数之和为2 + 3 + 5 + 7 = 17.求出n以下所有素数的总和。

Instructions

Tests

tests:
  - text: <code>primeSummation(17)</code>应该返回41。
    testString: assert.strictEqual(primeSummation(17), 41);
  - text: <code>primeSummation(2001)</code>应该返回277050。
    testString: assert.strictEqual(primeSummation(2001), 277050);
  - text: <code>primeSummation(140759)</code>应该返回873608362。
    testString: assert.strictEqual(primeSummation(140759), 873608362);
  - text: <code>primeSummation(2000000)</code>应返回142913828922。
    testString: assert.strictEqual(primeSummation(2000000), 142913828922);

Challenge Seed

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

primeSummation(2000000);

Solution

// solution required