2018-09-30 22:01:58 +00:00
---
id: 5900f4661000cf542c50ff78
challengeType: 5
title: 'Problem 250: 250250'
---
## 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 13:37:37 +00:00
tests:
- text: < code > euler250()</ code > should return 1425480602091519.
2018-10-08 00:01:53 +00:00
testString: 'assert.strictEqual(euler250(), 1425480602091519, "< code > euler250()< / code > should return 1425480602091519.");'
2018-09-30 22:01:58 +00:00
```
< / section >
## Challenge Seed
< section id = 'challengeSeed' >
< div id = 'js-seed' >
```js
function euler250() {
// Good luck!
return true;
}
euler250();
```
< / div >
< / section >
## Solution
< section id = 'solution' >
```js
// solution required
```
< / section >