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

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

Browse Source
This commit is contained in:
camperbot
2022-04-05 23:36:59 +05:30
committed by GitHub
parent 3a01deef48
commit d886ea11ef
80 changed files with 325 additions and 101 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-244-sliders.md
View File

@ -16,7 +16,9 @@ Um movimento é indicado pela primeira letra maiúscula da direção (Left - Esq
Para cada caminho, seu valor de verificação é calculado por (pseudocódigo):
$$\begin{align} & \text{checksum} = 0 \\\\ & \text{checksum} = (\text{checksum} × 243 + m_1) \\; \text{mod} \\; 100\\,000\\,007 \\\\ & \text{checksum} = (\text{checksum} × 243 + m_2) \\; \text{mod} \\; 100\\,000\\,007 \\\\ & \ldots \\\\ & \text{checksum} = (\text{checksum} × 243 + m_n) \\; \text{mod} \\; 100\\,000\\,007 \end{align}$$
$$\begin{align} & \text{checksum} = 0 \\\\
& \text{checksum} = (\text{checksum} × 243 + m_1) \\; \text{mod} \\; 100\\,000\\,007 \\\\ & \text{checksum} = (\text{checksum} × 243 + m_2) \\; \text{mod} \\; 100\\,000\\,007 \\\\
& \ldots \\\\ & \text{checksum} = (\text{checksum} × 243 + m_n) \\; \text{mod} \\; 100\\,000\\,007 \end{align}$$
onde $m_k$ é o valor ASCII da $k^{\text{a}}$ letra na sequência de movimento e os valores ASCII dos movimentos são: