HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Recursion > problem:


50727 - Fibonacci Numbers

Guest
• Review clarifications (2)

Section problems

• 50475 - Voice advertising
• 50909 - Gold Coins
• 50376 - Sequences
• 50725 - Fibonacci Series
• 50385 - The 3n + 1 problem
• 50911 - Symmetric Array
• 50381 - Sum of the numbers
• 50389 - Reverse an Array
• 50727 - Fibonacci Numbers
• 50415 - The Scientist
• 50421 - Repairing road segments
• 50935 - Max Discount
• 50724 - Number of Circles
• 50729 - Max number in 2D array
• 51081 - Fish Pond I
• 50726 - Pascal Triangle - 1
• 50928 - War Of Battleships

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
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