2021-06-15 07:49:18 +00:00
|
|
|
---
|
|
|
|
id: 5900f50f1000cf542c510021
|
2021-08-20 07:00:51 +00:00
|
|
|
title: 'Problema 418: Trios de fatoração'
|
2021-06-15 07:49:18 +00:00
|
|
|
challengeType: 5
|
|
|
|
forumTopicId: 302087
|
|
|
|
dashedName: problem-418-factorisation-triples
|
|
|
|
---
|
|
|
|
|
|
|
|
# --description--
|
|
|
|
|
2021-08-20 07:00:51 +00:00
|
|
|
Considere $n$ um inteiro positivo. Um trio de números inteiros ($a$, $b$, $c$) é chamado de trio de fatoração de $n$ se:
|
2021-06-15 07:49:18 +00:00
|
|
|
|
2021-08-20 07:00:51 +00:00
|
|
|
- $1 ≤ a ≤ b ≤ c$
|
|
|
|
- $a \times b \times c = n$.
|
2021-06-15 07:49:18 +00:00
|
|
|
|
2021-08-20 07:00:51 +00:00
|
|
|
Defina $f(n)$ como $a + b + c$ para o trio da fatoração ($a$, $b$, $c$) de $n$ que minimiza $\frac{c}{a}$. Podemos mostrar que esse trio é único.
|
2021-06-15 07:49:18 +00:00
|
|
|
|
2021-08-20 07:00:51 +00:00
|
|
|
Por exemplo, $f(165) = 19$, $f(100\\,100) = 142$ e $f(20!) = 4\\,034\\,872$.
|
2021-06-15 07:49:18 +00:00
|
|
|
|
2021-08-20 07:00:51 +00:00
|
|
|
Encontre $f(43!)$.
|
2021-06-15 07:49:18 +00:00
|
|
|
|
|
|
|
# --hints--
|
|
|
|
|
2021-08-20 07:00:51 +00:00
|
|
|
`factorisationTriples()` deve retornar `1177163565297340400`.
|
2021-06-15 07:49:18 +00:00
|
|
|
|
|
|
|
```js
|
2021-08-20 07:00:51 +00:00
|
|
|
assert.strictEqual(factorisationTriples(), 1177163565297340400);
|
2021-06-15 07:49:18 +00:00
|
|
|
```
|
|
|
|
|
|
|
|
# --seed--
|
|
|
|
|
|
|
|
## --seed-contents--
|
|
|
|
|
|
|
|
```js
|
2021-08-20 07:00:51 +00:00
|
|
|
function factorisationTriples() {
|
2021-06-15 07:49:18 +00:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2021-08-20 07:00:51 +00:00
|
|
|
factorisationTriples();
|
2021-06-15 07:49:18 +00:00
|
|
|
```
|
|
|
|
|
|
|
|
# --solutions--
|
|
|
|
|
|
|
|
```js
|
|
|
|
// solution required
|
|
|
|
```
|