56 lines
991 B
Markdown
56 lines
991 B
Markdown
|
---
|
|||
|
|
id: 5900f4d01000cf542c50ffe2
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 355: Maximal coprime subset'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题355：最大互质子集
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">将Co（n）定义为来自{1,2，...，n}的一组相互共元素的最大可能和。例如，Co（10）是30并且在子集{1,5,7,8,9}上达到最大值。 <p>给出Co（30）= 193和Co（100）= 1356。 </p><p>找到Co（200000）。 </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler355()</code>应返回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>
|