freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-127-abc-hits.chinese.md at 3b65bc8191721b3a7259d2daee4bd76e200af5aa

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

1.2 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3ec1000cf542c50fefe	5	Problem 127: abc-hits		问题127：abc-hits

Description

n，rad（n）的基数是n的不同素因子的乘积。例如，504 = 23×32×7，因此rad（504）= 2×3×7 = 42.如果出现以下情况，我们将正整数（a，b，c）的三元组定义为abc-hit：GCD（ a，b）= GCD（a，c）= GCD（b，c）= 1 a <ba + b = c rad（abc）<c例如，（5,27,32）是abc-hit，因为：GCD（5,27）= GCD（5,32）= GCD（27,32）= 1 5 <27 5 + 27 = 32 rad（4320）= 30 <32事实证明abc-hits是非常罕见的c <1000只有31次abc命中，Σc= 12523。查找Σc表示c <120000。

Instructions

Tests

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

Challenge Seed

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

euler127();

Solution

// solution required

1.2 KiB Raw Blame History Unescape Escape