chore(i8n,learn): processed translations
This commit is contained in:
committed by
Mrugesh Mohapatra
parent
15047f2d90
commit
e5c44a3ae5
@ -0,0 +1,38 @@
|
||||
---
|
||||
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
|
||||
```
|
Reference in New Issue
Block a user