2018-09-30 23:01:58 +01:00
---
id: 5900f4661000cf542c50ff78
challengeType: 5
title: 'Problem 250: 250250'
2019-08-05 09:17:33 -07:00
forumTopicId: 301898
2018-09-30 23:01:58 +01:00
---
## Description
<section id='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.
</section>
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
2018-10-04 14:37:37 +01:00
tests:
- text: <code>euler250()</code> should return 1425480602091519.
2019-07-26 19:30:17 -07:00
testString: assert.strictEqual(euler250(), 1425480602091519);
2018-09-30 23:01:58 +01:00
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler250() {
2020-09-15 09:57:40 -07:00
2018-09-30 23:01:58 +01:00
return true;
}
euler250();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
2019-07-18 08:24:12 -07:00
2018-09-30 23:01:58 +01:00
</section>