ГлавнаяСборникиТурнирыРазделыФорумыУчастникиПечатьПомощьО системе

Сборники > Задачи со всего света > задача:


060. 50727 - Fibonacci Numbers

Гость
• Вопросы к жюри (2)

Задачи сборника

• 135. 50572 - Numrat Palindrome
• 145. 50586 - Palindrome te thjeshta
• 160. 50571 - Numrat Armstrong
• 50315 - Pig Latin
• 50353 - Cube of the Largest number
• 50296 - Total Discount Rate
• 50559 - Faktoret e thjeshte te numrit
• 040. 50354 - Intersecting Rectangles
• 060. 50727 - Fibonacci Numbers
• 061. 50733 - The Highest Average
• 076. 50289 - Monthly Allowance
• 080. 50347 - Selling Oranges
• 090. 50378 - Sum of the given digits
• 110. 50409 - Random Password Ge...
• 120. 50684 - Shuma e numrave pri...
• 130. 50652 - Faktorizimi ne numra prim
• 140. 50393 - Palindromic Numbers

Обратная связь

Если у вас есть предложения или пожелания по работе Contester, посетите форум сайта www.contester.ru.

Лимит времени 2000/4000/4000/4000 мс. Лимит памяти 65000/65000/65000/65000 Кб.
Prepared by Ibrahim Mesecan.

Fibonacci Numbers

Although first described in India, The Fibonacci sequence has become famous after Fibonacci introduced it in his book Liber Abaci. Except the first two numbers (Fibonacci(0)=1 and Fibonacci(1)=1), Fibonacci numbers are formed as the sum of previous 2 Fibonacci numbers.
Fibonacci(2)= Fibonacci(1) + Fibonacci(0);
Fibonacci(3)= Fibonacci(2) + Fibonacci(1);
Fibonacci(4)= Fibonacci(3) + Fibonacci(2);
etc..

Question:
Write a program that calculates nth element of the Fibonacci sequence.

Input specification
You will be given one integer number (n) where 0 ≤ n ≤ 30

Output specification
Show one integer number which is nth element of the Fibonacci sequence.

Sample Input I   
  5
Sample Input II   
  12
Sample Output I   
  8
Sample Output II   
  233


Для отправки решений необходимо выполнить вход.

www.contester.ru