56 lines
1.0 KiB
Markdown
56 lines
1.0 KiB
Markdown
---
|
|
id: 5900f4d01000cf542c50ffe2
|
|
challengeType: 5
|
|
title: 'Problem 355: Maximal coprime subset'
|
|
videoUrl: ''
|
|
localeTitle: 'Problema 355: subconjunto máximo de coprime'
|
|
---
|
|
|
|
## Description
|
|
<section id="description"> Defina Co (n) como la suma máxima posible de un conjunto de elementos de cebado primordial de {1, 2, ..., n}. Por ejemplo, Co (10) es 30 y alcanza ese máximo en el subconjunto {1, 5, 7, 8, 9}. <p> Se le da que Co (30) = 193 y Co (100) = 1356. </p><p> Encuentra Co (200000). </p></section>
|
|
|
|
## Instructions
|
|
<section id="instructions">
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler355()</code> debe devolver 1726545007.
|
|
testString: 'assert.strictEqual(euler355(), 1726545007, "<code>euler355()</code> should return 1726545007.");'
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler355() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler355();
|
|
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|