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>
39 lines
587 B
Markdown
39 lines
587 B
Markdown
---
|
|
id: 5900f4661000cf542c50ff78
|
|
title: 'Problem 250: 250250'
|
|
challengeType: 5
|
|
forumTopicId: 301898
|
|
dashedName: problem-250-250250
|
|
---
|
|
|
|
# --description--
|
|
|
|
Find the number of non-empty subsets of {11, 22, 33,..., 250250250250}, the sum of whose elements is divisible by 250. Enter the rightmost 16 digits as your answer.
|
|
|
|
# --hints--
|
|
|
|
`euler250()` should return 1425480602091519.
|
|
|
|
```js
|
|
assert.strictEqual(euler250(), 1425480602091519);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler250() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler250();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|