67de105117
* fix: clean-up Project Euler 241-260 * fix: typo * Update curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
39 lines
632 B
Markdown
39 lines
632 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, \ldots, {250250}^{250250}\\}$, the sum of whose elements is divisible by 250. Enter the rightmost 16 digits as your answer.
|
|
|
|
# --hints--
|
|
|
|
`twoHundredFifty()` should return `1425480602091519`.
|
|
|
|
```js
|
|
assert.strictEqual(twoHundredFifty(), 1425480602091519);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function twoHundredFifty() {
|
|
|
|
return true;
|
|
}
|
|
|
|
twoHundredFifty();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|