Skip to content
Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Avian Kickoff Round #1 > C. Fibonacci Number

Fibonacci Number

Difficulty: 1100 1000 ms 128 MB

math dp

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

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen