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

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

Browse Source
This commit is contained in:
camperbot
2022-03-31 22:31:59 +05:30
committed by GitHub
parent 01f5769190
commit a3a8b8cb5e
137 changed files with 557 additions and 310 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
View File

@ -32,7 +32,9 @@ Sia $C(n, a, b)$ il costo per il peggio scenario ottenuto da una strategia ottim
Ecco alcuni esempi:
$$\begin{align} & C(5, 2, 3) = 5 \\\\ & C(500, \sqrt{2}, \sqrt{3}) = 13.220\\,731\\,97\ldots \\\\ & C(20\\,000, 5, 7) = 82 \\\\ & C(2\\,000\\,000, √5, √7) = 49.637\\,559\\,55\ldots \\\\ \end{align}$$
$$\begin{align} & C(5, 2, 3) = 5 \\\\
& C(500, \sqrt{2}, \sqrt{3}) = 13.220\\,731\\,97\ldots \\\\ & C(20\\,000, 5, 7) = 82 \\\\
& C(2\\,000\\,000, √5, √7) = 49.637\\,559\\,55\ldots \\\\ \end{align}$$
Siano $F_k$ i numeri di Fibonacci: $F_k = F_{k - 1} + F_{k - 2}$ con i casi base $F_1 = F_2 = 1$.