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

curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md

@@ -1,6 +1,6 @@
 ---
 id: 5900f4fa1000cf542c51000d
-title: 'Problem 398: Cutting rope'
+title: 'Problema 398: Cortando cordas'
 challengeType: 5
 forumTopicId: 302063
 dashedName: problem-398-cutting-rope
@@ -8,18 +8,18 @@ dashedName: problem-398-cutting-rope
 
 # --description--
 
-Inside a rope of length n, n-1 points are placed with distance 1 from each other and from the endpoints. Among these points, we choose m-1 points at random and cut the rope at these points to create m segments.
+Dentro de uma corda de comprimento $n$, $n - 1$ pontos são colocados com distância de 1 um do outro e das extremidades. Entre esses pontos, escolhemos $m - 1$ pontos aleatórios e cortamos as cordas nesses pontos para criar $m$ segmentos.
 
-Let E(n, m) be the expected length of the second-shortest segment. For example, E(3, 2) = 2 and E(8, 3) = 16/7. Note that if multiple segments have the same shortest length the length of the second-shortest segment is defined as the same as the shortest length.
+Considere $E(n, m)$ como o comprimento esperado do segundo segmento menor. Por exemplo, $E(3, 2) = 2$ e $E(8, 3) = \frac{16}{7}$. Observe que, se diversos segmentos tiverem o mesmo comprimento menor, o segundo segmento menor é definido como igual ao comprimento menor.
 
-Find E(107, 100). Give your answer rounded to 5 decimal places behind the decimal point.
+Encontre $E({10}^7, 100)$. Dê sua resposta arredondada para 5 casas depois da vírgula.
 
 # --hints--
 
-`euler398()` should return 2010.59096.
+`cuttingRope()` deve retornar `2010.59096`.
 
 ```js
-assert.strictEqual(euler398(), 2010.59096);
+assert.strictEqual(cuttingRope(), 2010.59096);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler398(), 2010.59096);
 ## --seed-contents--
 
 ```js
-function euler398() {
+function cuttingRope() {
 
   return true;
 }
 
-euler398();
+cuttingRope();
 ```
 
 # --solutions--