Masalalar
#006
Fibonachchi sonlari
O'rtacha
1 s
256 MB
C++ (GCC 14)
Python 3.8
JavaScript (Node.js 12)
Fibonachchi ketma-ketligi quyidagicha aniqlanadi: F(0) = 0, F(1) = 1, F(n) = F(n − 1) + F(n − 2). Uning boshlanishi: 0, 1, 1, 2, 3, 5, 8, 13, 21, … n berilgan. F(n) ni toping.
Kiruvchi ma'lumotlar
Bitta butun son n.
Chiquvchi ma'lumotlar
Bitta butun son — F(n).
Cheklovlar
0 ≤ n ≤ 90 Maslahat: rekursiya juda sekin ishlaydi — sikl bilan hisoblang. F(90) 64-bitli butun songa (long long) sig'adi; JavaScript da BigInt dan foydalaning.
Misollar
Kirish #1
7
Chiqish #1
13
Kirish #2
10
Chiqish #2
55