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
695 B
Markdown
43 lines
695 B
Markdown
---
|
|
id: 5900f4d01000cf542c50ffe2
|
|
title: 'Problem 355: Maximal coprime subset'
|
|
challengeType: 5
|
|
forumTopicId: 302015
|
|
dashedName: problem-355-maximal-coprime-subset
|
|
---
|
|
|
|
# --description--
|
|
|
|
Define Co(n) to be the maximal possible sum of a set of mutually co-prime elements from {1, 2, ..., n}. For example Co(10) is 30 and hits that maximum on the subset {1, 5, 7, 8, 9}.
|
|
|
|
You are given that Co(30) = 193 and Co(100) = 1356.
|
|
|
|
Find Co(200000).
|
|
|
|
# --hints--
|
|
|
|
`euler355()` should return 1726545007.
|
|
|
|
```js
|
|
assert.strictEqual(euler355(), 1726545007);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler355() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler355();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|