freeCodeCamp/problem-379-least-common-multiple-count.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

965 B

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f4e81000cf542c50fffa	5	Problem 379: Least common multiple count		问题379：最少共同的多重计数

Description

设f（n）为具有x和y正整数的耦合数（x，y），x≤y，x和y的最小公倍数等于n。

令g为f的求和函数，即：g（n）=Σf（i），1≤i≤n。

你得到g（106）= 37429395。

找到g（1012）。

Instructions

Tests

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

Challenge Seed

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

euler379();

Solution

// solution required

965 B Raw Blame History Unescape Escape