chore(i18n,curriculum): update translations (#44177)

This commit is contained in:
camperbot
2021-11-15 06:40:48 -08:00
committed by GitHub
parent 9dc35e4397
commit e56c75ba68
22 changed files with 266 additions and 235 deletions

View File

@ -1,6 +1,6 @@
---
id: 5900f45d1000cf542c50ff6f
title: 'Problem 240: Top Dice'
title: 'Problema 240: Dados superiores'
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:
Há 1111 maneiras pelas quais cinco dados de 6 lados (lados numerados de 1 a 6) podem ser rolados de modo que os três maiores somem 15. Alguns exemplos:
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?
De quantas maneiras vinte dados de doze lados (lados numerados de 1 a 12) podem ser rolados de modo que a soma dos dez maiores seja 70?
# --hints--
`euler240()` should return 7448717393364182000.
`topDice()` deve retornar `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--