gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix(curriculum): clean-up Project Euler 241-260 (#42879)

Browse Source 
* 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>
This commit is contained in:
gikf
2021-07-16 12:21:45 +02:00
committed by GitHub
parent b2059684ef
commit 67de105117
20 changed files with 272 additions and 154 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-250-250250.md
View File

@ -8,14 +8,14 @@ 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.
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--
`euler250()` should return 1425480602091519.
`twoHundredFifty()` should return `1425480602091519`.
```js
assert.strictEqual(euler250(), 1425480602091519);
assert.strictEqual(twoHundredFifty(), 1425480602091519);
```
# --seed--
@ -23,12 +23,12 @@ assert.strictEqual(euler250(), 1425480602091519);
## --seed-contents--
```js
function euler250() {
function twoHundredFifty() {
return true;
}
euler250();
twoHundredFifty();
```
# --solutions--