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

chore(i18n,learn): processed translations (#45287)

Browse Source
This commit is contained in:
camperbot
2022-03-01 00:52:39 +05:30
committed by GitHub
parent b8667061a1
commit 18e5be9efa
91 changed files with 1112 additions and 888 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1,6 +1,6 @@
---
id: 5900f45d1000cf542c50ff6f
title: 'Problem 240: Top Dice'
title: 'Problema 240: I dadi migliori'
challengeType: 5
forumTopicId: 301887
dashedName: problem-240-top-dice
@ -8,24 +8,18 @@ dashedName: problem-240-top-dice
# --description--
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:
Ci sono 1111 modi in cui cinque dadi a 6 facce (le facce numerate da 1 a 6) possono essere lanciati in modo che i tre più grandi sommino a 15. Alcuni esempi sono:
D1,D2,D3,D4,D5 = 4,3,6,3,5
$$\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}$$
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
In how many ways can twenty 12-sided dice (sides numbered 1 to 12) be rolled so that the top ten sum to 70?
In quanti modi si possono lanciare venti dadi a 12 facce (facce numerate da 1 a 12) in modo che la somma dei dieci maggiori a 70?
# --hints--
`euler240()` should return 7448717393364182000.
`topDice()` dovrebbe restituire `7448717393364182000`.
```js
assert.strictEqual(euler240(), 7448717393364182000);
assert.strictEqual(topDice(), 7448717393364182000);
```
# --seed--
@ -33,12 +27,12 @@ assert.strictEqual(euler240(), 7448717393364182000);
## --seed-contents--
```js
function euler240() {
function topDice() {
return true;
}
euler240();
topDice();
```
# --solutions--