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>
43 lines
653 B
Markdown
43 lines
653 B
Markdown
---
|
||
id: 5900f4d01000cf542c50ffe2
|
||
title: 问题355：最大互质子集
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-355-maximal-coprime-subset
|
||
---
|
||
|
||
# --description--
|
||
|
||
将Co（n）定义为来自{1,2，...，n}的一组相互共元素的最大可能和。例如，Co（10）是30并且在子集{1,5,7,8,9}上达到最大值。
|
||
|
||
给出Co（30）= 193和Co（100）= 1356。
|
||
|
||
找到Co（200000）。
|
||
|
||
# --hints--
|
||
|
||
`euler355()`应返回1726545007。
|
||
|
||
```js
|
||
assert.strictEqual(euler355(), 1726545007);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler355() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler355();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|