61460c8601
search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
68 lines
1.0 KiB
Markdown
68 lines
1.0 KiB
Markdown
---
|
||
id: 5900f50f1000cf542c510021
|
||
challengeType: 5
|
||
title: 'Problem 418: Factorisation triples'
|
||
videoUrl: ''
|
||
localeTitle: 问题418：三重分解
|
||
---
|
||
|
||
## Description
|
||
<section id="description">
|
||
令n为正整数。 在以下情况下，整数三元组（a，b，c）称为n的分解三元组：
|
||
a·b·c = n。
|
||
|
||
将f（n）定义为n的因式分解三元组（a，b，c）的a + b + c，使c / a最小。 可以证明这一三元组是独特的。
|
||
|
||
|
||
例如，f（165）= 19，f（100100）= 142，f（20！）= 4034872。
|
||
|
||
|
||
查找f（43！）。
|
||
</section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler418()</code>应该返回1177163565297340400。
|
||
testString: assert.strictEqual(euler418(), 1177163565297340400);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler418() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler418();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|