freeCodeCamp/problem-179-consecutive-positive-divisors.chinese.md at be4070a73dbc05eb4d4dbfef6dbdaee16e0b34a9

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

822 B

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f41f1000cf542c50ff32	5	Problem 179: Consecutive positive divisors		问题179：连续的正向除数

Description

求整数1 <n <107，其中n和n + 1具有相同的正除数。例如，14具有正除数1,2,7,14而15具有1,3,5,15。

Instructions

Tests

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

Challenge Seed

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

euler179();

Solution

// solution required

822 B Raw Blame History Unescape Escape