ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
39 lines
943 B
Markdown
39 lines
943 B
Markdown
---
|
||
id: 5900f3ec1000cf542c50fefe
|
||
title: 问题127：abc-hits
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-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。
|
||
|
||
# --hints--
|
||
|
||
`euler127()`应该返回18407904。
|
||
|
||
```js
|
||
assert.strictEqual(euler127(), 18407904);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler127() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler127();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|