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

fix(curriculum): clean-up Project Euler 221-240 (#42839)

Browse Source 
* fix: clean-up Project Euler 221-240

* fix: corrections from review

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
This commit is contained in:
gikf
2021-07-15 14:26:34 +02:00
committed by GitHub
parent 30c22d1fb3
commit a9418a1fe9
20 changed files with 233 additions and 173 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-240-top-dice.md
View File

@ -10,22 +10,21 @@ dashedName: problem-240-top-dice
There are 1111 ways in which five 6-sided dice (sides numbered 1 to 6) can be rolled so that the top three sum to 15. Some examples are:
D1,D2,D3,D4,D5 = 4,3,6,3,5
D1,D2,D3,D4,D5 = 4,3,3,5,6
D1,D2,D3,D4,D5 = 3,3,3,6,6
D1,D2,D3,D4,D5 = 6,6,3,3,3
$$\begin{align}
& D_1,D_2,D_3,D_4,D_5 = 4,3,6,3,5 \\\\
& D_1,D_2,D_3,D_4,D_5 = 4,3,3,5,6 \\\\
& D_1,D_2,D_3,D_4,D_5 = 3,3,3,6,6 \\\\
& D_1,D_2,D_3,D_4,D_5 = 6,6,3,3,3
\end{align}$$
In how many ways can twenty 12-sided dice (sides numbered 1 to 12) be rolled so that the top ten sum to 70?
# --hints--
`euler240()` should return 7448717393364182000.
`topDice()` should return `7448717393364182000`.
```js
assert.strictEqual(euler240(), 7448717393364182000);
assert.strictEqual(topDice(), 7448717393364182000);
```
# --seed--
@ -33,12 +32,12 @@ assert.strictEqual(euler240(), 7448717393364182000);
## --seed-contents--
```js
function euler240() {
function topDice() {
return true;
}
euler240();
topDice();
```
# --solutions--