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

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

Browse Source
This commit is contained in:
camperbot
2021-11-09 10:15:00 -08:00
committed by GitHub
parent 229fa686ca
commit b0165ad25d
22 changed files with 324 additions and 257 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-161-triominoes.md
View File

@@ -1,6 +1,6 @@
---
id: 5900f40d1000cf542c50ff20
title: 'Problem 161: Triominoes'
title: 'Problema 161: Triominos'
challengeType: 5
forumTopicId: 301795
dashedName: problem-161-triominoes
@@ -8,22 +8,28 @@ dashedName: problem-161-triominoes
# --description--
A triomino is a shape consisting of three squares joined via the edges.
Um triomino é uma forma que consiste de três quadrados unidos pelas bordas.
There are two basic forms:
Existem duas formas básicas:
If all possible orientations are taken into account there are six:
<img class="img-responsive center-block" alt="duas formas básicas de triominos" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-1.gif" style="background-color: white; padding: 10px;" />
Any n by m grid for which nxm is divisible by 3 can be tiled with triominoes. If we consider tilings that can be obtained by reflection or rotation from another tiling as different there are 41 ways a 2 by 9 grid can be tiled with triominoes:
Se todas as orientações possíveis forem levadas em conta, existem seis:
In how many ways can a 9 by 12 grid be tiled in this way by triominoes?
<img class="img-responsive center-block" alt="formas de triominos incluindo orientação" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-2.gif" style="background-color: white; padding: 10px;" />
Qualquer grid n por m para qual n * m é divisível por 3 pode ser preenchido por triominos. Se considerarmos que os agrupamentos que podem ser obtidos por reflexão ou rotação de outro agrupamento diferente, existem 41 maneiras de um grid de 2 por 9 ser completado por triominos:
<img class="img-responsive center-block" alt="animação mostrando 41 maneiras de preencher a grade 2x9 com triominos" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-3.gif" style="background-color: white; padding: 10px;" />
De quantas maneiras um grid 9 por 12 pode ser encaixados dessa forma por triominos?
# --hints--
`euler161()` should return 20574308184277972.
`triominoes()` deve retornar `20574308184277972`.
```js
assert.strictEqual(euler161(), 20574308184277972);
assert.strictEqual(triominoes(), 20574308184277972);
```
# --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler161(), 20574308184277972);
## --seed-contents--
```js
function euler161() {
function triominoes() {
return true;
}
euler161();
triominoes();
```
# --solutions--