Fibonacci Number
The Fibonacci sequence is defined by F(0)=0, F(1)=1 and F(n)=F(n−1)+F(n−2). Given n, print F(n).
Input: one integer n (0 ≤ n ≤ 80).
Output: F(n).
Note: F(80) = 23416728348467685, which does not fit in 32 bits.
Sample Tests
Input 1
0
Output 1
0
Input 2
10
Output 2
55
Discussion (opens after you solve — no spoilers before)
No comments yet.