Muallif: __thecrash__
B. Fibonachchi soni
Vaqt limiti: 2000 ms Xotira limiti: 256 mb
Fibonachchi ketma-ketligi quyidagicha aniqlanadi:
\(F(1) = 1\), \(F(2) = 1\), va \(n \ge 3\) uchun \(F(n) = F(n-1) + F(n-2)\) (ya'ni har bir keyingi son, oldingi ikkita sonning yig'indisiga teng).
Ketma-ketlikning boshlanishi: \(1, 1, 2, 3, 5, 8, \ldots\)
Butun son \(n\) berilgan. \(F(n)\) ni toping.
Kiruvchi ma'lumotlar
Yagona qatorda butun son \(n\) beriladi (\(1 \le n \le 50\)).
Chiquvchi ma'lumotlar
\(F(n)\) ning qiymatini chiqaring.
Misollar
| # | Input.txt | Output.txt |
|---|---|---|
| 1 |
7 |
13 |
| 2 |
1 |
1 |