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

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

Browse Source
This commit is contained in:
camperbot
2021-11-29 08:32:04 -08:00
committed by GitHub
parent aa9215b111
commit a8b0332720
124 changed files with 1217 additions and 945 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md
View File

@@ -14,7 +14,7 @@ Considere que $F(m, n)$ é o número de maneiras pelas quais o sapo pode viajar,
Por exemplo, $F(1, 3) = 4$, $F(1, 4) = 15$, $F(1, 5) = 46$, $F(2, 3) = 16$ e $F(2, 100)\bmod {10}^9 = 429.619.151$.
Encontre os últimos 9 dígitos de $F(10, {10}^{12})$.
Encontre os últimos 9 algarismos de $F(10, {10}^{12})$.
# --hints--