Fibonacci n-th

Computer Mathematics Easy 3 views
Back to Questions
Previous No previous question
Next Arithmetic Progression Term Easy N

Problem Description

Compute the n-th Fibonacci number (0-indexed).

Input Format

One integer n.

Output Format

One integer.

Sample Test Case

Input:
7
Output:
13

Constraints

0
Please login to submit solutions and comments.

Solutions (0)

No solutions submitted yet. Be the first!

Discussion (0)

No comments yet. Start the discussion!

Prev
Next